TSTP Solution File: SEU144+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU144+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:30:33 EDT 2023
% Result : Theorem 0.21s 0.56s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 9 unt; 0 def)
% Number of atoms : 78 ( 28 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 81 ( 30 ~; 37 |; 8 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 50 ( 3 sgn; 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.D8hu6otT8W/E---3.1_1972.p',d2_tarski) ).
fof(l2_zfmisc_1,conjecture,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.D8hu6otT8W/E---3.1_1972.p',l2_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.D8hu6otT8W/E---3.1_1972.p',d3_tarski) ).
fof(t69_enumset1,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.D8hu6otT8W/E---3.1_1972.p',t69_enumset1) ).
fof(c_0_4,plain,
! [X116,X117,X118,X119,X120,X121,X122,X123] :
( ( ~ in(X119,X118)
| X119 = X116
| X119 = X117
| X118 != unordered_pair(X116,X117) )
& ( X120 != X116
| in(X120,X118)
| X118 != unordered_pair(X116,X117) )
& ( X120 != X117
| in(X120,X118)
| X118 != unordered_pair(X116,X117) )
& ( esk10_3(X121,X122,X123) != X121
| ~ in(esk10_3(X121,X122,X123),X123)
| X123 = unordered_pair(X121,X122) )
& ( esk10_3(X121,X122,X123) != X122
| ~ in(esk10_3(X121,X122,X123),X123)
| X123 = unordered_pair(X121,X122) )
& ( in(esk10_3(X121,X122,X123),X123)
| esk10_3(X121,X122,X123) = X121
| esk10_3(X121,X122,X123) = X122
| X123 = unordered_pair(X121,X122) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tarski])])])])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
inference(assume_negation,[status(cth)],[l2_zfmisc_1]) ).
fof(c_0_6,plain,
! [X22,X23,X24,X25,X26] :
( ( ~ subset(X22,X23)
| ~ in(X24,X22)
| in(X24,X23) )
& ( in(esk5_2(X25,X26),X25)
| subset(X25,X26) )
& ( ~ in(esk5_2(X25,X26),X26)
| subset(X25,X26) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])]) ).
cnf(c_0_7,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( ( ~ subset(singleton(esk1_0),esk2_0)
| ~ in(esk1_0,esk2_0) )
& ( subset(singleton(esk1_0),esk2_0)
| in(esk1_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,lemma,
! [X63] : unordered_pair(X63,X63) = singleton(X63),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
cnf(c_0_10,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_7])]) ).
cnf(c_0_12,negated_conjecture,
( subset(singleton(esk1_0),esk2_0)
| in(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,lemma,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( ~ subset(singleton(esk1_0),esk2_0)
| ~ in(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( in(X1,X2)
| ~ subset(unordered_pair(X3,X1),X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( subset(unordered_pair(esk1_0,esk1_0),esk2_0)
| in(esk1_0,esk2_0) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( ~ subset(unordered_pair(esk1_0,esk1_0),esk2_0)
| ~ in(esk1_0,esk2_0) ),
inference(rw,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
in(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( X1 = X3
| X1 = X4
| ~ in(X1,X2)
| X2 != unordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_20,negated_conjecture,
~ subset(unordered_pair(esk1_0,esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,plain,
( in(esk5_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,plain,
( X1 = X2
| X1 = X3
| ~ in(X1,unordered_pair(X3,X2)) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
in(esk5_2(unordered_pair(esk1_0,esk1_0),esk2_0),unordered_pair(esk1_0,esk1_0)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( subset(X1,X2)
| ~ in(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
esk5_2(unordered_pair(esk1_0,esk1_0),esk2_0) = esk1_0,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_18])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU144+2 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 08:51:21 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.D8hu6otT8W/E---3.1_1972.p
% 0.21/0.56 # Version: 3.1pre001
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # Starting sh5l with 300s (1) cores
% 0.21/0.56 # new_bool_1 with pid 2083 completed with status 0
% 0.21/0.56 # Result found by new_bool_1
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.56 # Search class: FGHSM-FFMS32-SFFFFFNN
% 0.21/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.21/0.56 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 2086 completed with status 0
% 0.21/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.56 # Search class: FGHSM-FFMS32-SFFFFFNN
% 0.21/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.21/0.56 # Preprocessing time : 0.002 s
% 0.21/0.56 # Presaturation interreduction done
% 0.21/0.56
% 0.21/0.56 # Proof found!
% 0.21/0.56 # SZS status Theorem
% 0.21/0.56 # SZS output start CNFRefutation
% See solution above
% 0.21/0.56 # Parsed axioms : 65
% 0.21/0.56 # Removed by relevancy pruning/SinE : 16
% 0.21/0.56 # Initial clauses : 81
% 0.21/0.56 # Removed in clause preprocessing : 0
% 0.21/0.56 # Initial clauses in saturation : 81
% 0.21/0.56 # Processed clauses : 784
% 0.21/0.56 # ...of these trivial : 17
% 0.21/0.56 # ...subsumed : 409
% 0.21/0.56 # ...remaining for further processing : 358
% 0.21/0.56 # Other redundant clauses eliminated : 25
% 0.21/0.56 # Clauses deleted for lack of memory : 0
% 0.21/0.56 # Backward-subsumed : 43
% 0.21/0.56 # Backward-rewritten : 37
% 0.21/0.56 # Generated clauses : 1849
% 0.21/0.56 # ...of the previous two non-redundant : 1426
% 0.21/0.56 # ...aggressively subsumed : 0
% 0.21/0.56 # Contextual simplify-reflections : 1
% 0.21/0.56 # Paramodulations : 1813
% 0.21/0.56 # Factorizations : 14
% 0.21/0.56 # NegExts : 0
% 0.21/0.56 # Equation resolutions : 25
% 0.21/0.56 # Total rewrite steps : 756
% 0.21/0.56 # Propositional unsat checks : 0
% 0.21/0.56 # Propositional check models : 0
% 0.21/0.56 # Propositional check unsatisfiable : 0
% 0.21/0.56 # Propositional clauses : 0
% 0.21/0.56 # Propositional clauses after purity: 0
% 0.21/0.56 # Propositional unsat core size : 0
% 0.21/0.56 # Propositional preprocessing time : 0.000
% 0.21/0.56 # Propositional encoding time : 0.000
% 0.21/0.56 # Propositional solver time : 0.000
% 0.21/0.56 # Success case prop preproc time : 0.000
% 0.21/0.56 # Success case prop encoding time : 0.000
% 0.21/0.56 # Success case prop solver time : 0.000
% 0.21/0.56 # Current number of processed clauses : 185
% 0.21/0.56 # Positive orientable unit clauses : 57
% 0.21/0.56 # Positive unorientable unit clauses: 4
% 0.21/0.56 # Negative unit clauses : 38
% 0.21/0.56 # Non-unit-clauses : 86
% 0.21/0.56 # Current number of unprocessed clauses: 792
% 0.21/0.56 # ...number of literals in the above : 1839
% 0.21/0.56 # Current number of archived formulas : 0
% 0.21/0.56 # Current number of archived clauses : 156
% 0.21/0.56 # Clause-clause subsumption calls (NU) : 2174
% 0.21/0.56 # Rec. Clause-clause subsumption calls : 1822
% 0.21/0.56 # Non-unit clause-clause subsumptions : 115
% 0.21/0.56 # Unit Clause-clause subsumption calls : 544
% 0.21/0.56 # Rewrite failures with RHS unbound : 0
% 0.21/0.56 # BW rewrite match attempts : 104
% 0.21/0.56 # BW rewrite match successes : 69
% 0.21/0.56 # Condensation attempts : 0
% 0.21/0.56 # Condensation successes : 0
% 0.21/0.56 # Termbank termtop insertions : 19293
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.043 s
% 0.21/0.56 # System time : 0.002 s
% 0.21/0.56 # Total time : 0.045 s
% 0.21/0.56 # Maximum resident set size: 1916 pages
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.046 s
% 0.21/0.56 # System time : 0.003 s
% 0.21/0.56 # Total time : 0.049 s
% 0.21/0.56 # Maximum resident set size: 1724 pages
% 0.21/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------