TSTP Solution File: SWC340+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC340+1 : TPTP v8.1.2. Released v2.4.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:42:40 EDT 2023
% Result : Theorem 35.34s 4.90s
% Output : CNFRefutation 35.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 38 ( 16 unt; 0 def)
% Number of atoms : 191 ( 20 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 240 ( 87 ~; 99 |; 27 &)
% ( 3 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn; 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ strictorderedP(X3)
| ( segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0MP7zPU8GK/E---3.1_23245.p',co1) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0MP7zPU8GK/E---3.1_23245.p',ax12) ).
fof(ax11,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0MP7zPU8GK/E---3.1_23245.p',ax11) ).
fof(ax93,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0MP7zPU8GK/E---3.1_23245.p',ax93) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ strictorderedP(X3)
| ( segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_5,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& segmentP(esk4_0,esk3_0)
& strictorderedP(esk3_0)
& ( ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_6,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
segmentP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,plain,
! [X43,X44,X45,X46,X47,X48] :
( ( ~ strictorderedP(X43)
| ~ ssItem(X44)
| ~ ssItem(X45)
| ~ ssList(X46)
| ~ ssList(X47)
| ~ ssList(X48)
| app(app(X46,cons(X44,X47)),cons(X45,X48)) != X43
| lt(X44,X45)
| ~ ssList(X43) )
& ( ssItem(esk12_1(X43))
| strictorderedP(X43)
| ~ ssList(X43) )
& ( ssItem(esk13_1(X43))
| strictorderedP(X43)
| ~ ssList(X43) )
& ( ssList(esk14_1(X43))
| strictorderedP(X43)
| ~ ssList(X43) )
& ( ssList(esk15_1(X43))
| strictorderedP(X43)
| ~ ssList(X43) )
& ( ssList(esk16_1(X43))
| strictorderedP(X43)
| ~ ssList(X43) )
& ( app(app(esk14_1(X43),cons(esk12_1(X43),esk15_1(X43))),cons(esk13_1(X43),esk16_1(X43))) = X43
| strictorderedP(X43)
| ~ ssList(X43) )
& ( ~ lt(esk12_1(X43),esk13_1(X43))
| strictorderedP(X43)
| ~ ssList(X43) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax12])])])])]) ).
fof(c_0_11,plain,
! [X11,X12,X13,X14,X15,X16] :
( ( ~ totalorderedP(X11)
| ~ ssItem(X12)
| ~ ssItem(X13)
| ~ ssList(X14)
| ~ ssList(X15)
| ~ ssList(X16)
| app(app(X14,cons(X12,X15)),cons(X13,X16)) != X11
| leq(X12,X13)
| ~ ssList(X11) )
& ( ssItem(esk5_1(X11))
| totalorderedP(X11)
| ~ ssList(X11) )
& ( ssItem(esk6_1(X11))
| totalorderedP(X11)
| ~ ssList(X11) )
& ( ssList(esk7_1(X11))
| totalorderedP(X11)
| ~ ssList(X11) )
& ( ssList(esk8_1(X11))
| totalorderedP(X11)
| ~ ssList(X11) )
& ( ssList(esk9_1(X11))
| totalorderedP(X11)
| ~ ssList(X11) )
& ( app(app(esk7_1(X11),cons(esk5_1(X11),esk8_1(X11))),cons(esk6_1(X11),esk9_1(X11))) = X11
| totalorderedP(X11)
| ~ ssList(X11) )
& ( ~ leq(esk5_1(X11),esk6_1(X11))
| totalorderedP(X11)
| ~ ssList(X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax11])])])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ totalorderedP(esk1_0)
| ~ segmentP(esk4_0,esk1_0) ),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_13,negated_conjecture,
segmentP(esk4_0,esk1_0),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
fof(c_0_14,plain,
! [X68,X69] :
( ( X68 != X69
| ~ lt(X68,X69)
| ~ ssItem(X69)
| ~ ssItem(X68) )
& ( leq(X68,X69)
| ~ lt(X68,X69)
| ~ ssItem(X69)
| ~ ssItem(X68) )
& ( X68 = X69
| ~ leq(X68,X69)
| lt(X68,X69)
| ~ ssItem(X69)
| ~ ssItem(X68) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax93])])])]) ).
cnf(c_0_15,plain,
( lt(X2,X3)
| ~ strictorderedP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( app(app(esk7_1(X1),cons(esk5_1(X1),esk8_1(X1))),cons(esk6_1(X1),esk9_1(X1))) = X1
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
~ totalorderedP(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_19,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,plain,
( ssList(esk9_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( ssList(esk8_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,plain,
( ssList(esk7_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,plain,
( ssItem(esk6_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,plain,
( ssItem(esk5_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,plain,
( totalorderedP(X1)
| ~ leq(esk5_1(X1),esk6_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,plain,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,plain,
( lt(X1,X2)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_28,negated_conjecture,
app(app(esk7_1(esk1_0),cons(esk5_1(esk1_0),esk8_1(esk1_0))),cons(esk6_1(esk1_0),esk9_1(esk1_0))) = esk1_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_29,negated_conjecture,
strictorderedP(esk1_0),
inference(rw,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_30,negated_conjecture,
ssList(esk9_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_18]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk8_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_17]),c_0_18]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk7_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_18]) ).
cnf(c_0_33,negated_conjecture,
ssItem(esk6_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_17]),c_0_18]) ).
cnf(c_0_34,negated_conjecture,
ssItem(esk5_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_17]),c_0_18]) ).
cnf(c_0_35,plain,
( totalorderedP(X1)
| ~ lt(esk5_1(X1),esk6_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24]),c_0_23]) ).
cnf(c_0_36,negated_conjecture,
lt(esk5_1(esk1_0),esk6_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_17]),c_0_30]),c_0_31]),c_0_32]),c_0_33]),c_0_34])]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_17])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SWC340+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 01:59:21 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 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.0MP7zPU8GK/E---3.1_23245.p
% 35.34/4.90 # Version: 3.1pre001
% 35.34/4.90 # Preprocessing class: FSLSSMSSSSSNFFN.
% 35.34/4.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.34/4.90 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 35.34/4.90 # Starting new_bool_3 with 300s (1) cores
% 35.34/4.90 # Starting new_bool_1 with 300s (1) cores
% 35.34/4.90 # Starting sh5l with 300s (1) cores
% 35.34/4.90 # new_bool_3 with pid 23323 completed with status 0
% 35.34/4.90 # Result found by new_bool_3
% 35.34/4.90 # Preprocessing class: FSLSSMSSSSSNFFN.
% 35.34/4.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.34/4.90 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 35.34/4.90 # Starting new_bool_3 with 300s (1) cores
% 35.34/4.90 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 35.34/4.90 # Search class: FGHSF-FFMM21-MFFFFFNN
% 35.34/4.90 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 35.34/4.90 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 35.34/4.90 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23326 completed with status 0
% 35.34/4.90 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 35.34/4.90 # Preprocessing class: FSLSSMSSSSSNFFN.
% 35.34/4.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.34/4.90 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 35.34/4.90 # Starting new_bool_3 with 300s (1) cores
% 35.34/4.90 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 35.34/4.90 # Search class: FGHSF-FFMM21-MFFFFFNN
% 35.34/4.90 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 35.34/4.90 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 35.34/4.90 # Preprocessing time : 0.003 s
% 35.34/4.90 # Presaturation interreduction done
% 35.34/4.90
% 35.34/4.90 # Proof found!
% 35.34/4.90 # SZS status Theorem
% 35.34/4.90 # SZS output start CNFRefutation
% See solution above
% 35.34/4.90 # Parsed axioms : 96
% 35.34/4.90 # Removed by relevancy pruning/SinE : 45
% 35.34/4.90 # Initial clauses : 96
% 35.34/4.90 # Removed in clause preprocessing : 2
% 35.34/4.90 # Initial clauses in saturation : 94
% 35.34/4.90 # Processed clauses : 7157
% 35.34/4.90 # ...of these trivial : 92
% 35.34/4.90 # ...subsumed : 3864
% 35.34/4.90 # ...remaining for further processing : 3201
% 35.34/4.90 # Other redundant clauses eliminated : 200
% 35.34/4.90 # Clauses deleted for lack of memory : 0
% 35.34/4.90 # Backward-subsumed : 113
% 35.34/4.90 # Backward-rewritten : 131
% 35.34/4.90 # Generated clauses : 300784
% 35.34/4.90 # ...of the previous two non-redundant : 298317
% 35.34/4.90 # ...aggressively subsumed : 0
% 35.34/4.90 # Contextual simplify-reflections : 347
% 35.34/4.90 # Paramodulations : 300529
% 35.34/4.90 # Factorizations : 0
% 35.34/4.90 # NegExts : 0
% 35.34/4.90 # Equation resolutions : 256
% 35.34/4.90 # Total rewrite steps : 31044
% 35.34/4.90 # Propositional unsat checks : 0
% 35.34/4.90 # Propositional check models : 0
% 35.34/4.90 # Propositional check unsatisfiable : 0
% 35.34/4.90 # Propositional clauses : 0
% 35.34/4.90 # Propositional clauses after purity: 0
% 35.34/4.90 # Propositional unsat core size : 0
% 35.34/4.90 # Propositional preprocessing time : 0.000
% 35.34/4.90 # Propositional encoding time : 0.000
% 35.34/4.90 # Propositional solver time : 0.000
% 35.34/4.90 # Success case prop preproc time : 0.000
% 35.34/4.90 # Success case prop encoding time : 0.000
% 35.34/4.90 # Success case prop solver time : 0.000
% 35.34/4.90 # Current number of processed clauses : 2861
% 35.34/4.90 # Positive orientable unit clauses : 29
% 35.34/4.90 # Positive unorientable unit clauses: 0
% 35.34/4.90 # Negative unit clauses : 2
% 35.34/4.90 # Non-unit-clauses : 2830
% 35.34/4.90 # Current number of unprocessed clauses: 291276
% 35.34/4.90 # ...number of literals in the above : 1168037
% 35.34/4.90 # Current number of archived formulas : 0
% 35.34/4.90 # Current number of archived clauses : 332
% 35.34/4.90 # Clause-clause subsumption calls (NU) : 373341
% 35.34/4.90 # Rec. Clause-clause subsumption calls : 191511
% 35.34/4.90 # Non-unit clause-clause subsumptions : 4313
% 35.34/4.90 # Unit Clause-clause subsumption calls : 8101
% 35.34/4.90 # Rewrite failures with RHS unbound : 0
% 35.34/4.90 # BW rewrite match attempts : 38
% 35.34/4.90 # BW rewrite match successes : 10
% 35.34/4.90 # Condensation attempts : 0
% 35.34/4.90 # Condensation successes : 0
% 35.34/4.90 # Termbank termtop insertions : 6245525
% 35.34/4.90
% 35.34/4.90 # -------------------------------------------------
% 35.34/4.90 # User time : 4.143 s
% 35.34/4.90 # System time : 0.241 s
% 35.34/4.90 # Total time : 4.384 s
% 35.34/4.90 # Maximum resident set size: 2072 pages
% 35.34/4.90
% 35.34/4.90 # -------------------------------------------------
% 35.34/4.90 # User time : 4.145 s
% 35.34/4.90 # System time : 0.244 s
% 35.34/4.90 # Total time : 4.389 s
% 35.34/4.90 # Maximum resident set size: 1796 pages
% 35.34/4.90 % E---3.1 exiting
%------------------------------------------------------------------------------