TSTP Solution File: SWC272+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC272+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : Tue May 21 04:28:45 EDT 2024
% Result : Theorem 4.28s 1.02s
% Output : CNFRefutation 4.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 14 unt; 0 def)
% Number of atoms : 217 ( 35 equ)
% Maximal formula atoms : 30 ( 6 avg)
% Number of connectives : 280 ( 98 ~; 111 |; 43 &)
% ( 4 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 7 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 6 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn 44 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ~ ssList(X5)
| app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) )
| totalorderedP(X1)
| ( nil != X4
& nil = X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax93,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax93) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',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/sandbox/benchmark/Axioms/SWC001+0.ax',ax11) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ~ ssList(X5)
| app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) )
| totalorderedP(X1)
| ( nil != X4
& nil = X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_5,negated_conjecture,
! [X15,X16,X17,X18] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& app(esk3_0,esk5_0) = esk4_0
& strictorderedP(esk3_0)
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk5_0
| ~ ssItem(X17)
| ~ ssList(X18)
| app(X18,cons(X17,nil)) != esk3_0
| ~ lt(X17,X15) )
& ~ totalorderedP(esk1_0)
& ( nil = esk4_0
| nil != esk3_0 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
fof(c_0_6,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
inference(fof_simplification,[status(thm)],[ax93]) ).
fof(c_0_7,plain,
! [X81,X82,X83,X84,X85,X86] :
( ( ~ strictorderedP(X81)
| ~ ssItem(X82)
| ~ ssItem(X83)
| ~ ssList(X84)
| ~ ssList(X85)
| ~ ssList(X86)
| app(app(X84,cons(X82,X85)),cons(X83,X86)) != X81
| lt(X82,X83)
| ~ ssList(X81) )
& ( ssItem(esk15_1(X81))
| strictorderedP(X81)
| ~ ssList(X81) )
& ( ssItem(esk16_1(X81))
| strictorderedP(X81)
| ~ ssList(X81) )
& ( ssList(esk17_1(X81))
| strictorderedP(X81)
| ~ ssList(X81) )
& ( ssList(esk18_1(X81))
| strictorderedP(X81)
| ~ ssList(X81) )
& ( ssList(esk19_1(X81))
| strictorderedP(X81)
| ~ ssList(X81) )
& ( app(app(esk17_1(X81),cons(esk15_1(X81),esk18_1(X81))),cons(esk16_1(X81),esk19_1(X81))) = X81
| strictorderedP(X81)
| ~ ssList(X81) )
& ( ~ lt(esk15_1(X81),esk16_1(X81))
| strictorderedP(X81)
| ~ ssList(X81) ) ),
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)],[ax12])])])])])]) ).
fof(c_0_8,plain,
! [X24,X25,X26,X27,X28,X29] :
( ( ~ totalorderedP(X24)
| ~ ssItem(X25)
| ~ ssItem(X26)
| ~ ssList(X27)
| ~ ssList(X28)
| ~ ssList(X29)
| app(app(X27,cons(X25,X28)),cons(X26,X29)) != X24
| leq(X25,X26)
| ~ ssList(X24) )
& ( ssItem(esk8_1(X24))
| totalorderedP(X24)
| ~ ssList(X24) )
& ( ssItem(esk9_1(X24))
| totalorderedP(X24)
| ~ ssList(X24) )
& ( ssList(esk10_1(X24))
| totalorderedP(X24)
| ~ ssList(X24) )
& ( ssList(esk11_1(X24))
| totalorderedP(X24)
| ~ ssList(X24) )
& ( ssList(esk12_1(X24))
| totalorderedP(X24)
| ~ ssList(X24) )
& ( app(app(esk10_1(X24),cons(esk8_1(X24),esk11_1(X24))),cons(esk9_1(X24),esk12_1(X24))) = X24
| totalorderedP(X24)
| ~ ssList(X24) )
& ( ~ leq(esk8_1(X24),esk9_1(X24))
| totalorderedP(X24)
| ~ ssList(X24) ) ),
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)],[ax11])])])])])]) ).
cnf(c_0_9,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
~ totalorderedP(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_12,plain,
! [X49,X50] :
( ( X49 != X50
| ~ lt(X49,X50)
| ~ ssItem(X50)
| ~ ssItem(X49) )
& ( leq(X49,X50)
| ~ lt(X49,X50)
| ~ ssItem(X50)
| ~ ssItem(X49) )
& ( X49 = X50
| ~ leq(X49,X50)
| lt(X49,X50)
| ~ ssItem(X50)
| ~ ssItem(X49) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
cnf(c_0_13,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_7]) ).
cnf(c_0_14,plain,
( app(app(esk10_1(X1),cons(esk8_1(X1),esk11_1(X1))),cons(esk9_1(X1),esk12_1(X1))) = X1
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
~ totalorderedP(esk3_0),
inference(rw,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_17,plain,
( ssList(esk12_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( ssList(esk11_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,plain,
( ssList(esk10_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,plain,
( ssItem(esk9_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,plain,
( ssItem(esk8_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
( totalorderedP(X1)
| ~ leq(esk8_1(X1),esk9_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,plain,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,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_13]) ).
cnf(c_0_25,negated_conjecture,
app(app(esk10_1(esk3_0),cons(esk8_1(esk3_0),esk11_1(esk3_0))),cons(esk9_1(esk3_0),esk12_1(esk3_0))) = esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_26,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk12_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_16]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk11_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_16]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk10_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_15]),c_0_16]) ).
cnf(c_0_30,negated_conjecture,
ssItem(esk9_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_16]) ).
cnf(c_0_31,negated_conjecture,
ssItem(esk8_1(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_15]),c_0_16]) ).
cnf(c_0_32,plain,
( totalorderedP(X1)
| ~ lt(esk8_1(X1),esk9_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_21]),c_0_20]) ).
cnf(c_0_33,negated_conjecture,
lt(esk8_1(esk3_0),esk9_1(esk3_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_24,c_0_25]),c_0_26]),c_0_15]),c_0_27]),c_0_28]),c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_15])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC272+1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n014.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 : Sun May 19 03:27:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/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/benchmark/theBenchmark.p
% 4.28/1.02 # Version: 3.1.0
% 4.28/1.02 # Preprocessing class: FSLSSMSSSSSNFFN.
% 4.28/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.28/1.02 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 4.28/1.02 # Starting new_bool_3 with 300s (1) cores
% 4.28/1.02 # Starting new_bool_1 with 300s (1) cores
% 4.28/1.02 # Starting sh5l with 300s (1) cores
% 4.28/1.02 # new_bool_3 with pid 10948 completed with status 0
% 4.28/1.02 # Result found by new_bool_3
% 4.28/1.02 # Preprocessing class: FSLSSMSSSSSNFFN.
% 4.28/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.28/1.02 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 4.28/1.02 # Starting new_bool_3 with 300s (1) cores
% 4.28/1.02 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.28/1.02 # Search class: FGHSF-FFMM21-MFFFFFNN
% 4.28/1.02 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.28/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 4.28/1.02 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10960 completed with status 0
% 4.28/1.02 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.28/1.02 # Preprocessing class: FSLSSMSSSSSNFFN.
% 4.28/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.28/1.02 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 4.28/1.02 # Starting new_bool_3 with 300s (1) cores
% 4.28/1.02 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.28/1.02 # Search class: FGHSF-FFMM21-MFFFFFNN
% 4.28/1.02 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.28/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 4.28/1.02 # Preprocessing time : 0.003 s
% 4.28/1.02 # Presaturation interreduction done
% 4.28/1.02
% 4.28/1.02 # Proof found!
% 4.28/1.02 # SZS status Theorem
% 4.28/1.02 # SZS output start CNFRefutation
% See solution above
% 4.28/1.02 # Parsed axioms : 96
% 4.28/1.02 # Removed by relevancy pruning/SinE : 52
% 4.28/1.02 # Initial clauses : 88
% 4.28/1.02 # Removed in clause preprocessing : 2
% 4.28/1.02 # Initial clauses in saturation : 86
% 4.28/1.02 # Processed clauses : 4209
% 4.28/1.02 # ...of these trivial : 440
% 4.28/1.02 # ...subsumed : 2694
% 4.28/1.02 # ...remaining for further processing : 1075
% 4.28/1.02 # Other redundant clauses eliminated : 61
% 4.28/1.02 # Clauses deleted for lack of memory : 0
% 4.28/1.02 # Backward-subsumed : 22
% 4.28/1.02 # Backward-rewritten : 2
% 4.28/1.02 # Generated clauses : 30142
% 4.28/1.02 # ...of the previous two non-redundant : 27660
% 4.28/1.02 # ...aggressively subsumed : 0
% 4.28/1.02 # Contextual simplify-reflections : 84
% 4.28/1.02 # Paramodulations : 30058
% 4.28/1.02 # Factorizations : 0
% 4.28/1.02 # NegExts : 0
% 4.28/1.02 # Equation resolutions : 85
% 4.28/1.02 # Disequality decompositions : 0
% 4.28/1.02 # Total rewrite steps : 8120
% 4.28/1.02 # ...of those cached : 8102
% 4.28/1.02 # Propositional unsat checks : 0
% 4.28/1.02 # Propositional check models : 0
% 4.28/1.02 # Propositional check unsatisfiable : 0
% 4.28/1.02 # Propositional clauses : 0
% 4.28/1.02 # Propositional clauses after purity: 0
% 4.28/1.02 # Propositional unsat core size : 0
% 4.28/1.02 # Propositional preprocessing time : 0.000
% 4.28/1.02 # Propositional encoding time : 0.000
% 4.28/1.02 # Propositional solver time : 0.000
% 4.28/1.02 # Success case prop preproc time : 0.000
% 4.28/1.02 # Success case prop encoding time : 0.000
% 4.28/1.02 # Success case prop solver time : 0.000
% 4.28/1.02 # Current number of processed clauses : 965
% 4.28/1.02 # Positive orientable unit clauses : 22
% 4.28/1.02 # Positive unorientable unit clauses: 0
% 4.28/1.02 # Negative unit clauses : 2
% 4.28/1.02 # Non-unit-clauses : 941
% 4.28/1.02 # Current number of unprocessed clauses: 23597
% 4.28/1.02 # ...number of literals in the above : 111089
% 4.28/1.02 # Current number of archived formulas : 0
% 4.28/1.02 # Current number of archived clauses : 104
% 4.28/1.02 # Clause-clause subsumption calls (NU) : 145835
% 4.28/1.02 # Rec. Clause-clause subsumption calls : 67774
% 4.28/1.02 # Non-unit clause-clause subsumptions : 2799
% 4.28/1.02 # Unit Clause-clause subsumption calls : 679
% 4.28/1.02 # Rewrite failures with RHS unbound : 0
% 4.28/1.02 # BW rewrite match attempts : 17
% 4.28/1.02 # BW rewrite match successes : 2
% 4.28/1.02 # Condensation attempts : 0
% 4.28/1.02 # Condensation successes : 0
% 4.28/1.02 # Termbank termtop insertions : 522733
% 4.28/1.02 # Search garbage collected termcells : 2243
% 4.28/1.02
% 4.28/1.02 # -------------------------------------------------
% 4.28/1.02 # User time : 0.500 s
% 4.28/1.02 # System time : 0.020 s
% 4.28/1.02 # Total time : 0.520 s
% 4.28/1.02 # Maximum resident set size: 2068 pages
% 4.28/1.02
% 4.28/1.02 # -------------------------------------------------
% 4.28/1.02 # User time : 0.503 s
% 4.28/1.02 # System time : 0.022 s
% 4.28/1.02 # Total time : 0.526 s
% 4.28/1.02 # Maximum resident set size: 1824 pages
% 4.28/1.02 % E---3.1 exiting
%------------------------------------------------------------------------------