TSTP Solution File: SEU229+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU229+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:30:56 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 7 unt; 0 def)
% Number of atoms : 112 ( 55 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 138 ( 57 ~; 56 |; 21 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-4 aty)
% Number of variables : 92 ( 12 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_enumset1,axiom,
! [X1,X2,X3,X4] :
( X4 = unordered_triple(X1,X2,X3)
<=> ! [X5] :
( in(X5,X4)
<=> ~ ( X5 != X1
& X5 != X2
& X5 != X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YwVDTLkDQ1/E---3.1_16588.p',d1_enumset1) ).
fof(t7_tarski,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& ! [X3] :
~ ( in(X3,X2)
& ! [X4] :
~ ( in(X4,X2)
& in(X4,X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YwVDTLkDQ1/E---3.1_16588.p',t7_tarski) ).
fof(t3_ordinal1,conjecture,
! [X1,X2,X3] :
~ ( in(X1,X2)
& in(X2,X3)
& in(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.YwVDTLkDQ1/E---3.1_16588.p',t3_ordinal1) ).
fof(c_0_3,plain,
! [X1,X2,X3,X4] :
( X4 = unordered_triple(X1,X2,X3)
<=> ! [X5] :
( in(X5,X4)
<=> ~ ( X5 != X1
& X5 != X2
& X5 != X3 ) ) ),
inference(fof_simplification,[status(thm)],[d1_enumset1]) ).
fof(c_0_4,plain,
! [X11,X12,X13,X14,X15,X16,X17,X18,X19,X20] :
( ( ~ in(X15,X14)
| X15 = X11
| X15 = X12
| X15 = X13
| X14 != unordered_triple(X11,X12,X13) )
& ( X16 != X11
| in(X16,X14)
| X14 != unordered_triple(X11,X12,X13) )
& ( X16 != X12
| in(X16,X14)
| X14 != unordered_triple(X11,X12,X13) )
& ( X16 != X13
| in(X16,X14)
| X14 != unordered_triple(X11,X12,X13) )
& ( esk1_4(X17,X18,X19,X20) != X17
| ~ in(esk1_4(X17,X18,X19,X20),X20)
| X20 = unordered_triple(X17,X18,X19) )
& ( esk1_4(X17,X18,X19,X20) != X18
| ~ in(esk1_4(X17,X18,X19,X20),X20)
| X20 = unordered_triple(X17,X18,X19) )
& ( esk1_4(X17,X18,X19,X20) != X19
| ~ in(esk1_4(X17,X18,X19,X20),X20)
| X20 = unordered_triple(X17,X18,X19) )
& ( in(esk1_4(X17,X18,X19,X20),X20)
| esk1_4(X17,X18,X19,X20) = X17
| esk1_4(X17,X18,X19,X20) = X18
| esk1_4(X17,X18,X19,X20) = X19
| X20 = unordered_triple(X17,X18,X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[c_0_3])])])])])])]) ).
cnf(c_0_5,plain,
( X1 = X3
| X1 = X4
| X1 = X5
| ~ in(X1,X2)
| X2 != unordered_triple(X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X44,X45,X47] :
( ( in(esk16_2(X44,X45),X45)
| ~ in(X44,X45) )
& ( ~ in(X47,X45)
| ~ in(X47,esk16_2(X44,X45))
| ~ in(X44,X45) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_tarski])])])])])]) ).
cnf(c_0_7,plain,
( X1 = X2
| X1 = X3
| X1 = X4
| ~ in(X1,unordered_triple(X4,X3,X2)) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( in(esk16_2(X1,X2),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_triple(X4,X2,X5) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( esk16_2(X1,unordered_triple(X2,X3,X4)) = X4
| esk16_2(X1,unordered_triple(X2,X3,X4)) = X3
| esk16_2(X1,unordered_triple(X2,X3,X4)) = X2
| ~ in(X1,unordered_triple(X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
in(X1,unordered_triple(X2,X1,X3)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_12,plain,
( ~ in(X1,X2)
| ~ in(X1,esk16_2(X3,X2))
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( esk16_2(X1,unordered_triple(X2,X1,X3)) = X2
| esk16_2(X1,unordered_triple(X2,X1,X3)) = X1
| esk16_2(X1,unordered_triple(X2,X1,X3)) = X3 ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( in(X1,X2)
& in(X2,X3)
& in(X3,X1) ),
inference(assume_negation,[status(cth)],[t3_ordinal1]) ).
cnf(c_0_15,plain,
( esk16_2(X1,unordered_triple(X2,X1,X3)) = X1
| esk16_2(X1,unordered_triple(X2,X1,X3)) = X2
| ~ in(X4,unordered_triple(X2,X1,X3))
| ~ in(X4,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_11])]) ).
fof(c_0_16,negated_conjecture,
( in(esk13_0,esk14_0)
& in(esk14_0,esk15_0)
& in(esk15_0,esk13_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_17,plain,
( esk16_2(X1,unordered_triple(X2,X1,X3)) = X2
| esk16_2(X1,unordered_triple(X2,X1,X3)) = X1
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
in(esk15_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( esk16_2(esk15_0,unordered_triple(X1,esk15_0,esk13_0)) = esk15_0
| esk16_2(esk15_0,unordered_triple(X1,esk15_0,esk13_0)) = X1 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_triple(X4,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_21,negated_conjecture,
( esk16_2(esk15_0,unordered_triple(X1,esk15_0,esk13_0)) = esk15_0
| ~ in(X2,unordered_triple(X1,esk15_0,esk13_0))
| ~ in(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_11])]) ).
cnf(c_0_22,plain,
in(X1,unordered_triple(X2,X3,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
( esk16_2(esk15_0,unordered_triple(X1,esk15_0,esk13_0)) = esk15_0
| ~ in(esk13_0,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_triple(X2,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_25,negated_conjecture,
( ~ in(X1,unordered_triple(X2,esk15_0,esk13_0))
| ~ in(X1,esk15_0)
| ~ in(esk13_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_23]),c_0_11])]) ).
cnf(c_0_26,plain,
in(X1,unordered_triple(X1,X2,X3)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
( ~ in(X1,esk15_0)
| ~ in(esk13_0,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
in(esk14_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,negated_conjecture,
in(esk13_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU229+3 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 08:06:36 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.YwVDTLkDQ1/E---3.1_16588.p
% 0.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16692 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.21/0.52 # Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.21/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16701 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 811s (1) cores
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.52 # Preprocessing time : 0.002 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 26
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 53
% 0.21/0.52 # Removed in clause preprocessing : 2
% 0.21/0.52 # Initial clauses in saturation : 51
% 0.21/0.52 # Processed clauses : 275
% 0.21/0.52 # ...of these trivial : 5
% 0.21/0.52 # ...subsumed : 71
% 0.21/0.52 # ...remaining for further processing : 199
% 0.21/0.52 # Other redundant clauses eliminated : 135
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 5
% 0.21/0.52 # Backward-rewritten : 6
% 0.21/0.52 # Generated clauses : 1088
% 0.21/0.52 # ...of the previous two non-redundant : 871
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 2
% 0.21/0.52 # Paramodulations : 855
% 0.21/0.52 # Factorizations : 101
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 135
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 205
% 0.21/0.52 # ...of those cached : 163
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 136
% 0.21/0.52 # Positive orientable unit clauses : 32
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 19
% 0.21/0.52 # Non-unit-clauses : 85
% 0.21/0.52 # Current number of unprocessed clauses: 679
% 0.21/0.52 # ...number of literals in the above : 3202
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 59
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 1046
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 595
% 0.21/0.52 # Non-unit clause-clause subsumptions : 36
% 0.21/0.52 # Unit Clause-clause subsumption calls : 414
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 11
% 0.21/0.52 # BW rewrite match successes : 3
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 15161
% 0.21/0.52 # Search garbage collected termcells : 480
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.032 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.035 s
% 0.21/0.52 # Maximum resident set size: 1784 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.157 s
% 0.21/0.52 # System time : 0.009 s
% 0.21/0.52 # Total time : 0.166 s
% 0.21/0.52 # Maximum resident set size: 1708 pages
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------