TSTP Solution File: SWC241+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC241+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:24:51 EDT 2024
% Result : Theorem 0.59s 0.53s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 10 unt; 0 def)
% Number of atoms : 158 ( 41 equ)
% Maximal formula atoms : 46 ( 6 avg)
% Number of connectives : 212 ( 78 ~; 80 |; 38 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 45 ( 0 sgn 26 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) )
| ( nil != X3
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ~ ssList(X11)
| app(app(X10,cons(X9,nil)),X11) != X3
| ? [X12] :
( ssItem(X12)
& ~ leq(X12,X9)
& memberP(X10,X12)
& memberP(X11,X12)
& leq(X9,X12) ) ) ) ) ) ) ) ) ),
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(c_0_2,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) )
| ( nil != X3
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ~ ssList(X11)
| app(app(X10,cons(X9,nil)),X11) != X3
| ? [X12] :
( ssItem(X12)
& ~ leq(X12,X9)
& memberP(X10,X12)
& memberP(X11,X12)
& leq(X9,X12) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_3,negated_conjecture,
! [X17,X18,X19,X24] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& nil != esk1_0
& ( ssItem(esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X18,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X19,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( lt(X17,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ leq(X17,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ssItem(esk6_0)
| nil = esk3_0 )
& ( ssList(esk7_0)
| nil = esk3_0 )
& ( ssList(esk8_0)
| nil = esk3_0 )
& ( app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk3_0
| nil = esk3_0 )
& ( ~ ssItem(X24)
| leq(X24,esk6_0)
| ~ memberP(esk7_0,X24)
| ~ memberP(esk8_0,X24)
| ~ leq(esk6_0,X24)
| nil = esk3_0 ) ),
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)],[c_0_2])])])])])]) ).
fof(c_0_4,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( X1 != X2
& leq(X1,X2) ) ) ) ),
inference(fof_simplification,[status(thm)],[ax93]) ).
cnf(c_0_5,negated_conjecture,
( app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk3_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( ssList(esk8_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( ssList(esk7_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( ssItem(esk6_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_11,plain,
! [X73,X74] :
( ( X73 != X74
| ~ lt(X73,X74)
| ~ ssItem(X74)
| ~ ssItem(X73) )
& ( leq(X73,X74)
| ~ lt(X73,X74)
| ~ ssItem(X74)
| ~ ssItem(X73) )
& ( X73 = X74
| ~ leq(X73,X74)
| lt(X73,X74)
| ~ ssItem(X74)
| ~ ssItem(X73) ) ),
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_4])])])])]) ).
cnf(c_0_12,negated_conjecture,
( lt(X1,esk5_3(X1,X2,X3))
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk1_0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6]),c_0_7]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk8_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_6]),c_0_7]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk7_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_6]),c_0_7]) ).
cnf(c_0_16,negated_conjecture,
ssItem(esk6_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_6]),c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( ssItem(esk5_3(X1,X2,X3))
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_18,plain,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
lt(esk6_0,esk5_3(esk6_0,esk7_0,esk8_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_20,negated_conjecture,
ssItem(esk5_3(esk6_0,esk7_0,esk8_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_21,negated_conjecture,
( ~ leq(X1,esk5_3(X1,X2,X3))
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_22,negated_conjecture,
leq(esk6_0,esk5_3(esk6_0,esk7_0,esk8_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_16])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_13]),c_0_14]),c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC241+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 03:56:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.59/0.53 # Version: 3.1.0
% 0.59/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.59/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.59/0.53 # Starting sh5l with 300s (1) cores
% 0.59/0.53 # sh5l with pid 32281 completed with status 0
% 0.59/0.53 # Result found by sh5l
% 0.59/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.59/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.59/0.53 # Starting sh5l with 300s (1) cores
% 0.59/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.59/0.53 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.59/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.59/0.53 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 0.59/0.53 # G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 32287 completed with status 0
% 0.59/0.53 # Result found by G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.59/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.59/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.59/0.53 # Starting sh5l with 300s (1) cores
% 0.59/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.59/0.53 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.59/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.59/0.53 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 0.59/0.53 # Preprocessing time : 0.003 s
% 0.59/0.53 # Presaturation interreduction done
% 0.59/0.53
% 0.59/0.53 # Proof found!
% 0.59/0.53 # SZS status Theorem
% 0.59/0.53 # SZS output start CNFRefutation
% See solution above
% 0.59/0.53 # Parsed axioms : 96
% 0.59/0.53 # Removed by relevancy pruning/SinE : 10
% 0.59/0.53 # Initial clauses : 180
% 0.59/0.53 # Removed in clause preprocessing : 2
% 0.59/0.53 # Initial clauses in saturation : 178
% 0.59/0.53 # Processed clauses : 384
% 0.59/0.53 # ...of these trivial : 2
% 0.59/0.53 # ...subsumed : 9
% 0.59/0.53 # ...remaining for further processing : 373
% 0.59/0.53 # Other redundant clauses eliminated : 52
% 0.59/0.53 # Clauses deleted for lack of memory : 0
% 0.59/0.53 # Backward-subsumed : 0
% 0.59/0.53 # Backward-rewritten : 0
% 0.59/0.53 # Generated clauses : 611
% 0.59/0.53 # ...of the previous two non-redundant : 522
% 0.59/0.53 # ...aggressively subsumed : 0
% 0.59/0.53 # Contextual simplify-reflections : 8
% 0.59/0.53 # Paramodulations : 538
% 0.59/0.53 # Factorizations : 0
% 0.59/0.53 # NegExts : 0
% 0.59/0.53 # Equation resolutions : 73
% 0.59/0.53 # Disequality decompositions : 0
% 0.59/0.53 # Total rewrite steps : 181
% 0.59/0.53 # ...of those cached : 169
% 0.59/0.53 # Propositional unsat checks : 0
% 0.59/0.53 # Propositional check models : 0
% 0.59/0.53 # Propositional check unsatisfiable : 0
% 0.59/0.53 # Propositional clauses : 0
% 0.59/0.53 # Propositional clauses after purity: 0
% 0.59/0.53 # Propositional unsat core size : 0
% 0.59/0.53 # Propositional preprocessing time : 0.000
% 0.59/0.53 # Propositional encoding time : 0.000
% 0.59/0.53 # Propositional solver time : 0.000
% 0.59/0.53 # Success case prop preproc time : 0.000
% 0.59/0.53 # Success case prop encoding time : 0.000
% 0.59/0.53 # Success case prop solver time : 0.000
% 0.59/0.53 # Current number of processed clauses : 196
% 0.59/0.53 # Positive orientable unit clauses : 28
% 0.59/0.53 # Positive unorientable unit clauses: 0
% 0.59/0.53 # Negative unit clauses : 2
% 0.59/0.53 # Non-unit-clauses : 166
% 0.59/0.53 # Current number of unprocessed clauses: 486
% 0.59/0.53 # ...number of literals in the above : 3382
% 0.59/0.53 # Current number of archived formulas : 0
% 0.59/0.53 # Current number of archived clauses : 174
% 0.59/0.53 # Clause-clause subsumption calls (NU) : 10273
% 0.59/0.53 # Rec. Clause-clause subsumption calls : 2039
% 0.59/0.53 # Non-unit clause-clause subsumptions : 17
% 0.59/0.53 # Unit Clause-clause subsumption calls : 5
% 0.59/0.53 # Rewrite failures with RHS unbound : 0
% 0.59/0.53 # BW rewrite match attempts : 0
% 0.59/0.53 # BW rewrite match successes : 0
% 0.59/0.53 # Condensation attempts : 0
% 0.59/0.53 # Condensation successes : 0
% 0.59/0.53 # Termbank termtop insertions : 30398
% 0.59/0.53 # Search garbage collected termcells : 3991
% 0.59/0.53
% 0.59/0.53 # -------------------------------------------------
% 0.59/0.53 # User time : 0.046 s
% 0.59/0.53 # System time : 0.004 s
% 0.59/0.53 # Total time : 0.050 s
% 0.59/0.53 # Maximum resident set size: 2452 pages
% 0.59/0.53
% 0.59/0.53 # -------------------------------------------------
% 0.59/0.53 # User time : 0.050 s
% 0.59/0.53 # System time : 0.006 s
% 0.59/0.53 # Total time : 0.056 s
% 0.59/0.53 # Maximum resident set size: 1828 pages
% 0.59/0.53 % E---3.1 exiting
% 0.59/0.53 % E exiting
%------------------------------------------------------------------------------