TSTP Solution File: SWC271+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC271+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 181.37s 23.40s
% Output : CNFRefutation 181.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 7 unt; 0 def)
% Number of atoms : 199 ( 19 equ)
% Maximal formula atoms : 30 ( 6 avg)
% Number of connectives : 261 ( 91 ~; 105 |; 35 &)
% ( 4 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn 39 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& strictorderedP(X5) )
| totalorderedP(X1) ) ) ) ) ),
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(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,plain,
! [X26,X27,X28,X29,X30,X31] :
( ( ~ strictorderedP(X26)
| ~ ssItem(X27)
| ~ ssItem(X28)
| ~ ssList(X29)
| ~ ssList(X30)
| ~ ssList(X31)
| app(app(X29,cons(X27,X30)),cons(X28,X31)) != X26
| lt(X27,X28)
| ~ ssList(X26) )
& ( ssItem(esk10_1(X26))
| strictorderedP(X26)
| ~ ssList(X26) )
& ( ssItem(esk11_1(X26))
| strictorderedP(X26)
| ~ ssList(X26) )
& ( ssList(esk12_1(X26))
| strictorderedP(X26)
| ~ ssList(X26) )
& ( ssList(esk13_1(X26))
| strictorderedP(X26)
| ~ ssList(X26) )
& ( ssList(esk14_1(X26))
| strictorderedP(X26)
| ~ ssList(X26) )
& ( app(app(esk12_1(X26),cons(esk10_1(X26),esk13_1(X26))),cons(esk11_1(X26),esk14_1(X26))) = X26
| strictorderedP(X26)
| ~ ssList(X26) )
& ( ~ lt(esk10_1(X26),esk11_1(X26))
| strictorderedP(X26)
| ~ ssList(X26) ) ),
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_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& strictorderedP(X5) )
| totalorderedP(X1) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
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]) ).
cnf(c_0_7,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_4]) ).
fof(c_0_8,plain,
! [X12,X13,X14,X15,X16,X17] :
( ( ~ totalorderedP(X12)
| ~ ssItem(X13)
| ~ ssItem(X14)
| ~ ssList(X15)
| ~ ssList(X16)
| ~ ssList(X17)
| app(app(X15,cons(X13,X16)),cons(X14,X17)) != X12
| leq(X13,X14)
| ~ ssList(X12) )
& ( ssItem(esk5_1(X12))
| totalorderedP(X12)
| ~ ssList(X12) )
& ( ssItem(esk6_1(X12))
| totalorderedP(X12)
| ~ ssList(X12) )
& ( ssList(esk7_1(X12))
| totalorderedP(X12)
| ~ ssList(X12) )
& ( ssList(esk8_1(X12))
| totalorderedP(X12)
| ~ ssList(X12) )
& ( ssList(esk9_1(X12))
| totalorderedP(X12)
| ~ ssList(X12) )
& ( app(app(esk7_1(X12),cons(esk5_1(X12),esk8_1(X12))),cons(esk6_1(X12),esk9_1(X12))) = X12
| totalorderedP(X12)
| ~ ssList(X12) )
& ( ~ leq(esk5_1(X12),esk6_1(X12))
| totalorderedP(X12)
| ~ ssList(X12) ) ),
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])])])])])]) ).
fof(c_0_9,negated_conjecture,
! [X11] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& frontsegP(esk4_0,esk3_0)
& strictorderedP(esk3_0)
& ( ~ ssList(X11)
| ~ neq(esk3_0,X11)
| ~ frontsegP(esk4_0,X11)
| ~ segmentP(X11,esk3_0)
| ~ strictorderedP(X11) )
& ~ totalorderedP(esk1_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_5])])])])]) ).
fof(c_0_10,plain,
! [X92,X93] :
( ( X92 != X93
| ~ lt(X92,X93)
| ~ ssItem(X93)
| ~ ssItem(X92) )
& ( leq(X92,X93)
| ~ lt(X92,X93)
| ~ ssItem(X93)
| ~ ssItem(X92) )
& ( X92 = X93
| ~ leq(X92,X93)
| lt(X92,X93)
| ~ ssItem(X93)
| ~ ssItem(X92) ) ),
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_11,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_7]) ).
cnf(c_0_12,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_8]) ).
cnf(c_0_13,plain,
( ssItem(esk5_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ssItem(esk6_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ssList(esk7_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( ssList(esk8_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( ssList(esk9_1(X1))
| totalorderedP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
~ totalorderedP(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,plain,
( totalorderedP(X1)
| lt(esk5_1(X1),esk6_1(X1))
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17]) ).
cnf(c_0_22,plain,
( totalorderedP(X1)
| ~ leq(esk5_1(X1),esk6_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
~ totalorderedP(esk3_0),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( totalorderedP(X1)
| ~ strictorderedP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_13]),c_0_14]),c_0_22]) ).
cnf(c_0_26,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[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_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC271+1 : TPTP v8.2.0. Released v2.4.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n005.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 : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 03:43:23 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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
% 181.37/23.40 # Version: 3.1.0
% 181.37/23.40 # Preprocessing class: FSLSSMSSSSSNFFN.
% 181.37/23.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 181.37/23.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 181.37/23.40 # Starting new_bool_3 with 300s (1) cores
% 181.37/23.40 # Starting new_bool_1 with 300s (1) cores
% 181.37/23.40 # Starting sh5l with 300s (1) cores
% 181.37/23.40 # new_bool_1 with pid 25943 completed with status 0
% 181.37/23.40 # Result found by new_bool_1
% 181.37/23.40 # Preprocessing class: FSLSSMSSSSSNFFN.
% 181.37/23.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 181.37/23.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 181.37/23.40 # Starting new_bool_3 with 300s (1) cores
% 181.37/23.40 # Starting new_bool_1 with 300s (1) cores
% 181.37/23.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 181.37/23.40 # Search class: FGHSF-FSMM21-MFFFFFNN
% 181.37/23.40 # partial match(1): FGHSF-FSLM21-MFFFFFNN
% 181.37/23.40 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 181.37/23.40 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 181.37/23.40 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 25945 completed with status 0
% 181.37/23.40 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 181.37/23.40 # Preprocessing class: FSLSSMSSSSSNFFN.
% 181.37/23.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 181.37/23.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 181.37/23.40 # Starting new_bool_3 with 300s (1) cores
% 181.37/23.40 # Starting new_bool_1 with 300s (1) cores
% 181.37/23.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 181.37/23.40 # Search class: FGHSF-FSMM21-MFFFFFNN
% 181.37/23.40 # partial match(1): FGHSF-FSLM21-MFFFFFNN
% 181.37/23.40 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 181.37/23.40 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 181.37/23.40 # Preprocessing time : 0.004 s
% 181.37/23.40 # Presaturation interreduction done
% 181.37/23.40
% 181.37/23.40 # Proof found!
% 181.37/23.40 # SZS status Theorem
% 181.37/23.40 # SZS output start CNFRefutation
% See solution above
% 181.37/23.40 # Parsed axioms : 96
% 181.37/23.40 # Removed by relevancy pruning/SinE : 35
% 181.37/23.40 # Initial clauses : 114
% 181.37/23.40 # Removed in clause preprocessing : 2
% 181.37/23.40 # Initial clauses in saturation : 112
% 181.37/23.40 # Processed clauses : 49935
% 181.37/23.40 # ...of these trivial : 297
% 181.37/23.40 # ...subsumed : 41860
% 181.37/23.40 # ...remaining for further processing : 7778
% 181.37/23.40 # Other redundant clauses eliminated : 707
% 181.37/23.40 # Clauses deleted for lack of memory : 0
% 181.37/23.40 # Backward-subsumed : 568
% 181.37/23.40 # Backward-rewritten : 269
% 181.37/23.40 # Generated clauses : 959973
% 181.37/23.40 # ...of the previous two non-redundant : 927844
% 181.37/23.40 # ...aggressively subsumed : 0
% 181.37/23.40 # Contextual simplify-reflections : 4225
% 181.37/23.40 # Paramodulations : 959162
% 181.37/23.40 # Factorizations : 0
% 181.37/23.40 # NegExts : 0
% 181.37/23.40 # Equation resolutions : 812
% 181.37/23.40 # Disequality decompositions : 0
% 181.37/23.40 # Total rewrite steps : 798562
% 181.37/23.40 # ...of those cached : 798017
% 181.37/23.40 # Propositional unsat checks : 0
% 181.37/23.40 # Propositional check models : 0
% 181.37/23.40 # Propositional check unsatisfiable : 0
% 181.37/23.40 # Propositional clauses : 0
% 181.37/23.40 # Propositional clauses after purity: 0
% 181.37/23.40 # Propositional unsat core size : 0
% 181.37/23.40 # Propositional preprocessing time : 0.000
% 181.37/23.40 # Propositional encoding time : 0.000
% 181.37/23.40 # Propositional solver time : 0.000
% 181.37/23.40 # Success case prop preproc time : 0.000
% 181.37/23.40 # Success case prop encoding time : 0.000
% 181.37/23.40 # Success case prop solver time : 0.000
% 181.37/23.40 # Current number of processed clauses : 6822
% 181.37/23.40 # Positive orientable unit clauses : 573
% 181.37/23.40 # Positive unorientable unit clauses: 0
% 181.37/23.40 # Negative unit clauses : 3
% 181.37/23.40 # Non-unit-clauses : 6246
% 181.37/23.40 # Current number of unprocessed clauses: 876613
% 181.37/23.40 # ...number of literals in the above : 6219342
% 181.37/23.40 # Current number of archived formulas : 0
% 181.37/23.40 # Current number of archived clauses : 943
% 181.37/23.40 # Clause-clause subsumption calls (NU) : 8133595
% 181.37/23.40 # Rec. Clause-clause subsumption calls : 1491032
% 181.37/23.40 # Non-unit clause-clause subsumptions : 46567
% 181.37/23.40 # Unit Clause-clause subsumption calls : 79224
% 181.37/23.40 # Rewrite failures with RHS unbound : 0
% 181.37/23.40 # BW rewrite match attempts : 1699
% 181.37/23.40 # BW rewrite match successes : 144
% 181.37/23.40 # Condensation attempts : 0
% 181.37/23.40 # Condensation successes : 0
% 181.37/23.40 # Termbank termtop insertions : 26044836
% 181.37/23.40 # Search garbage collected termcells : 2685
% 181.37/23.40
% 181.37/23.40 # -------------------------------------------------
% 181.37/23.40 # User time : 21.894 s
% 181.37/23.40 # System time : 0.650 s
% 181.37/23.40 # Total time : 22.544 s
% 181.37/23.40 # Maximum resident set size: 2228 pages
% 181.37/23.40
% 181.37/23.40 # -------------------------------------------------
% 181.37/23.40 # User time : 21.896 s
% 181.37/23.40 # System time : 0.654 s
% 181.37/23.40 # Total time : 22.550 s
% 181.37/23.40 # Maximum resident set size: 1820 pages
% 181.37/23.40 % E---3.1 exiting
%------------------------------------------------------------------------------