TSTP Solution File: SEU280+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU280+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:31:17 EDT 2023
% Result : Theorem 0.21s 0.59s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 2
% Syntax : Number of formulae : 42 ( 6 unt; 0 def)
% Number of atoms : 190 ( 58 equ)
% Maximal formula atoms : 70 ( 4 avg)
% Number of connectives : 231 ( 83 ~; 115 |; 28 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 70 ( 8 sgn; 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s1_tarski__e6_22__wellord2__1,axiom,
! [X1] :
( ! [X2,X3,X4] :
( ( X2 = X3
& ordinal(X3)
& X2 = X4
& ordinal(X4) )
=> X3 = X4 )
=> ? [X2] :
! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X4,X1)
& X4 = X3
& ordinal(X3) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BSNQ1pTUOw/E---3.1_23634.p',s1_tarski__e6_22__wellord2__1) ).
fof(s1_xboole_0__e6_22__wellord2,conjecture,
! [X1] :
? [X2] :
! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& ordinal(X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BSNQ1pTUOw/E---3.1_23634.p',s1_xboole_0__e6_22__wellord2) ).
fof(c_0_2,plain,
! [X19,X21,X23,X24] :
( ( in(esk7_2(X19,X21),X19)
| ~ in(X21,esk6_1(X19))
| esk3_0 = esk4_0 )
& ( esk7_2(X19,X21) = X21
| ~ in(X21,esk6_1(X19))
| esk3_0 = esk4_0 )
& ( ordinal(X21)
| ~ in(X21,esk6_1(X19))
| esk3_0 = esk4_0 )
& ( ~ in(X24,X19)
| X24 != X23
| ~ ordinal(X23)
| in(X23,esk6_1(X19))
| esk3_0 = esk4_0 )
& ( in(esk7_2(X19,X21),X19)
| ~ in(X21,esk6_1(X19))
| ordinal(esk4_0) )
& ( esk7_2(X19,X21) = X21
| ~ in(X21,esk6_1(X19))
| ordinal(esk4_0) )
& ( ordinal(X21)
| ~ in(X21,esk6_1(X19))
| ordinal(esk4_0) )
& ( ~ in(X24,X19)
| X24 != X23
| ~ ordinal(X23)
| in(X23,esk6_1(X19))
| ordinal(esk4_0) )
& ( in(esk7_2(X19,X21),X19)
| ~ in(X21,esk6_1(X19))
| esk3_0 = esk5_0 )
& ( esk7_2(X19,X21) = X21
| ~ in(X21,esk6_1(X19))
| esk3_0 = esk5_0 )
& ( ordinal(X21)
| ~ in(X21,esk6_1(X19))
| esk3_0 = esk5_0 )
& ( ~ in(X24,X19)
| X24 != X23
| ~ ordinal(X23)
| in(X23,esk6_1(X19))
| esk3_0 = esk5_0 )
& ( in(esk7_2(X19,X21),X19)
| ~ in(X21,esk6_1(X19))
| ordinal(esk5_0) )
& ( esk7_2(X19,X21) = X21
| ~ in(X21,esk6_1(X19))
| ordinal(esk5_0) )
& ( ordinal(X21)
| ~ in(X21,esk6_1(X19))
| ordinal(esk5_0) )
& ( ~ in(X24,X19)
| X24 != X23
| ~ ordinal(X23)
| in(X23,esk6_1(X19))
| ordinal(esk5_0) )
& ( in(esk7_2(X19,X21),X19)
| ~ in(X21,esk6_1(X19))
| esk4_0 != esk5_0 )
& ( esk7_2(X19,X21) = X21
| ~ in(X21,esk6_1(X19))
| esk4_0 != esk5_0 )
& ( ordinal(X21)
| ~ in(X21,esk6_1(X19))
| esk4_0 != esk5_0 )
& ( ~ in(X24,X19)
| X24 != X23
| ~ ordinal(X23)
| in(X23,esk6_1(X19))
| esk4_0 != esk5_0 ) ),
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)],[s1_tarski__e6_22__wellord2__1])])])])])]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
? [X2] :
! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& ordinal(X3) ) ),
inference(assume_negation,[status(cth)],[s1_xboole_0__e6_22__wellord2]) ).
cnf(c_0_4,plain,
( in(X3,esk6_1(X2))
| esk3_0 = esk4_0
| ~ in(X1,X2)
| X1 != X3
| ~ ordinal(X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
fof(c_0_5,negated_conjecture,
! [X14] :
( ( ~ in(esk2_1(X14),X14)
| ~ in(esk2_1(X14),esk1_0)
| ~ ordinal(esk2_1(X14)) )
& ( in(esk2_1(X14),esk1_0)
| in(esk2_1(X14),X14) )
& ( ordinal(esk2_1(X14))
| in(esk2_1(X14),X14) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( esk3_0 = esk4_0
| in(X1,esk6_1(X2))
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( in(esk2_1(X1),esk1_0)
| in(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( ordinal(esk2_1(X1))
| in(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( esk3_0 = esk4_0
| in(esk2_1(X1),esk6_1(esk1_0))
| in(esk2_1(X1),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_10,plain,
( in(esk7_2(X1,X2),X1)
| esk3_0 = esk4_0
| ~ in(X2,esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( esk3_0 = esk4_0
| in(esk2_1(esk6_1(esk1_0)),esk6_1(esk1_0)) ),
inference(ef,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( esk7_2(X1,X2) = X2
| esk3_0 = esk4_0
| ~ in(X2,esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( ~ in(esk2_1(X1),X1)
| ~ in(esk2_1(X1),esk1_0)
| ~ ordinal(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( ordinal(X1)
| esk3_0 = esk4_0
| ~ in(X1,esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
( esk3_0 = esk4_0
| in(esk7_2(esk1_0,esk2_1(esk6_1(esk1_0))),esk1_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( esk7_2(esk1_0,esk2_1(esk6_1(esk1_0))) = esk2_1(esk6_1(esk1_0))
| esk3_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( esk3_0 = esk4_0
| ~ in(esk2_1(X1),esk6_1(X2))
| ~ in(esk2_1(X1),esk1_0)
| ~ in(esk2_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( esk3_0 = esk4_0
| in(esk2_1(esk6_1(esk1_0)),esk1_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( in(X3,esk6_1(X2))
| esk3_0 = esk5_0
| ~ in(X1,X2)
| X1 != X3
| ~ ordinal(X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_20,negated_conjecture,
( esk3_0 = esk4_0
| ~ in(esk2_1(esk6_1(esk1_0)),esk6_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_11]) ).
cnf(c_0_21,plain,
( in(X3,esk6_1(X2))
| ~ in(X1,X2)
| X1 != X3
| ~ ordinal(X3)
| esk4_0 != esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_22,plain,
( esk3_0 = esk5_0
| in(X1,esk6_1(X2))
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
esk3_0 = esk4_0,
inference(spm,[status(thm)],[c_0_20,c_0_11]) ).
cnf(c_0_24,plain,
( in(X1,esk6_1(X2))
| esk5_0 != esk4_0
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
( in(X1,esk6_1(X2))
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_26,plain,
( esk7_2(X1,X2) = X2
| esk3_0 = esk5_0
| ~ in(X2,esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_27,plain,
( esk7_2(X1,X2) = X2
| ~ in(X2,esk6_1(X1))
| esk4_0 != esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_28,negated_conjecture,
( in(esk2_1(X1),esk6_1(esk1_0))
| in(esk2_1(X1),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_7]),c_0_8]) ).
cnf(c_0_29,plain,
( ordinal(X1)
| esk3_0 = esk5_0
| ~ in(X1,esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_30,plain,
( ordinal(X1)
| ~ in(X1,esk6_1(X2))
| esk4_0 != esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_31,plain,
( in(esk7_2(X1,X2),X1)
| esk3_0 = esk5_0
| ~ in(X2,esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_32,plain,
( in(esk7_2(X1,X2),X1)
| ~ in(X2,esk6_1(X1))
| esk4_0 != esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_33,plain,
( esk7_2(X1,X2) = X2
| ~ in(X2,esk6_1(X1)) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_23]),c_0_27]) ).
cnf(c_0_34,negated_conjecture,
in(esk2_1(esk6_1(esk1_0)),esk6_1(esk1_0)),
inference(ef,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
( ordinal(X1)
| ~ in(X1,esk6_1(X2)) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_23]),c_0_30]) ).
cnf(c_0_36,plain,
( in(esk7_2(X1,X2),X1)
| ~ in(X2,esk6_1(X1)) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_23]),c_0_32]) ).
cnf(c_0_37,negated_conjecture,
esk7_2(esk1_0,esk2_1(esk6_1(esk1_0))) = esk2_1(esk6_1(esk1_0)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( ~ in(esk2_1(X1),esk6_1(X2))
| ~ in(esk2_1(X1),esk1_0)
| ~ in(esk2_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
in(esk2_1(esk6_1(esk1_0)),esk1_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_34]),c_0_37]) ).
cnf(c_0_40,negated_conjecture,
~ in(esk2_1(esk6_1(esk1_0)),esk6_1(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_34])]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_34,c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEU280+2 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n004.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:01:15 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.51 Running first-order model finding
% 0.21/0.51 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.BSNQ1pTUOw/E---3.1_23634.p
% 0.21/0.59 # Version: 3.1pre001
% 0.21/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.59 # Starting sh5l with 300s (1) cores
% 0.21/0.59 # new_bool_1 with pid 23718 completed with status 0
% 0.21/0.59 # Result found by new_bool_1
% 0.21/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.59 # Search class: FGHSF-FFMF21-SFFFFFNN
% 0.21/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.59 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 163s (1) cores
% 0.21/0.59 # 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 23720 completed with status 0
% 0.21/0.59 # Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.21/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.59 # Search class: FGHSF-FFMF21-SFFFFFNN
% 0.21/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.59 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 163s (1) cores
% 0.21/0.59 # Preprocessing time : 0.004 s
% 0.21/0.59 # Presaturation interreduction done
% 0.21/0.59
% 0.21/0.59 # Proof found!
% 0.21/0.59 # SZS status Theorem
% 0.21/0.59 # SZS output start CNFRefutation
% See solution above
% 0.21/0.59 # Parsed axioms : 364
% 0.21/0.59 # Removed by relevancy pruning/SinE : 351
% 0.21/0.59 # Initial clauses : 41
% 0.21/0.59 # Removed in clause preprocessing : 0
% 0.21/0.59 # Initial clauses in saturation : 41
% 0.21/0.59 # Processed clauses : 465
% 0.21/0.59 # ...of these trivial : 2
% 0.21/0.59 # ...subsumed : 124
% 0.21/0.59 # ...remaining for further processing : 339
% 0.21/0.59 # Other redundant clauses eliminated : 7
% 0.21/0.59 # Clauses deleted for lack of memory : 0
% 0.21/0.59 # Backward-subsumed : 56
% 0.21/0.59 # Backward-rewritten : 89
% 0.21/0.59 # Generated clauses : 1530
% 0.21/0.59 # ...of the previous two non-redundant : 1482
% 0.21/0.59 # ...aggressively subsumed : 0
% 0.21/0.59 # Contextual simplify-reflections : 26
% 0.21/0.59 # Paramodulations : 1512
% 0.21/0.59 # Factorizations : 8
% 0.21/0.59 # NegExts : 0
% 0.21/0.59 # Equation resolutions : 7
% 0.21/0.59 # Total rewrite steps : 153
% 0.21/0.59 # Propositional unsat checks : 0
% 0.21/0.59 # Propositional check models : 0
% 0.21/0.59 # Propositional check unsatisfiable : 0
% 0.21/0.59 # Propositional clauses : 0
% 0.21/0.59 # Propositional clauses after purity: 0
% 0.21/0.59 # Propositional unsat core size : 0
% 0.21/0.59 # Propositional preprocessing time : 0.000
% 0.21/0.59 # Propositional encoding time : 0.000
% 0.21/0.59 # Propositional solver time : 0.000
% 0.21/0.59 # Success case prop preproc time : 0.000
% 0.21/0.59 # Success case prop encoding time : 0.000
% 0.21/0.59 # Success case prop solver time : 0.000
% 0.21/0.59 # Current number of processed clauses : 145
% 0.21/0.59 # Positive orientable unit clauses : 7
% 0.21/0.59 # Positive unorientable unit clauses: 0
% 0.21/0.59 # Negative unit clauses : 13
% 0.21/0.59 # Non-unit-clauses : 125
% 0.21/0.59 # Current number of unprocessed clauses: 1091
% 0.21/0.59 # ...number of literals in the above : 5112
% 0.21/0.59 # Current number of archived formulas : 0
% 0.21/0.59 # Current number of archived clauses : 187
% 0.21/0.59 # Clause-clause subsumption calls (NU) : 7669
% 0.21/0.59 # Rec. Clause-clause subsumption calls : 4249
% 0.21/0.59 # Non-unit clause-clause subsumptions : 153
% 0.21/0.59 # Unit Clause-clause subsumption calls : 221
% 0.21/0.59 # Rewrite failures with RHS unbound : 0
% 0.21/0.59 # BW rewrite match attempts : 5
% 0.21/0.59 # BW rewrite match successes : 4
% 0.21/0.59 # Condensation attempts : 0
% 0.21/0.59 # Condensation successes : 0
% 0.21/0.59 # Termbank termtop insertions : 31643
% 0.21/0.59
% 0.21/0.59 # -------------------------------------------------
% 0.21/0.59 # User time : 0.057 s
% 0.21/0.59 # System time : 0.004 s
% 0.21/0.59 # Total time : 0.061 s
% 0.21/0.59 # Maximum resident set size: 2344 pages
% 0.21/0.59
% 0.21/0.59 # -------------------------------------------------
% 0.21/0.59 # User time : 0.067 s
% 0.21/0.59 # System time : 0.006 s
% 0.21/0.59 # Total time : 0.073 s
% 0.21/0.59 # Maximum resident set size: 2104 pages
% 0.21/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------