TSTP Solution File: SWC098+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC098+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:39:19 EDT 2023
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 173 ( 75 equ)
% Maximal formula atoms : 46 ( 4 avg)
% Number of connectives : 225 ( 87 ~; 90 |; 34 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn; 18 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X1
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X2,X6)
| ~ leq(X5,X6)
| X5 = X6 ) )
& memberP(X2,X5) )
| ( nil = X2
& nil = X1 )
| ( ! [X7] :
( ssItem(X7)
=> ( cons(X7,nil) != X3
| ~ memberP(X4,X7)
| ? [X8] :
( ssItem(X8)
& X7 != X8
& memberP(X4,X8)
& leq(X7,X8) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.4U4jB1vA5x/E---3.1_3638.p',co1) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.4U4jB1vA5x/E---3.1_3638.p',ax18) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.4U4jB1vA5x/E---3.1_3638.p',ax17) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X1
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X2,X6)
| ~ leq(X5,X6)
| X5 = X6 ) )
& memberP(X2,X5) )
| ( nil = X2
& nil = X1 )
| ( ! [X7] :
( ssItem(X7)
=> ( cons(X7,nil) != X3
| ~ memberP(X4,X7)
| ? [X8] :
( ssItem(X8)
& X7 != X8
& memberP(X4,X8)
& leq(X7,X8) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_4,negated_conjecture,
! [X13,X16] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( ssItem(esk5_1(X13))
| ~ ssItem(X13)
| cons(X13,nil) != esk1_0
| ~ memberP(esk2_0,X13) )
& ( memberP(esk2_0,esk5_1(X13))
| ~ ssItem(X13)
| cons(X13,nil) != esk1_0
| ~ memberP(esk2_0,X13) )
& ( leq(X13,esk5_1(X13))
| ~ ssItem(X13)
| cons(X13,nil) != esk1_0
| ~ memberP(esk2_0,X13) )
& ( X13 != esk5_1(X13)
| ~ ssItem(X13)
| cons(X13,nil) != esk1_0
| ~ memberP(esk2_0,X13) )
& ( nil != esk2_0
| nil != esk1_0 )
& ( nil = esk4_0
| ssItem(esk6_0) )
& ( nil = esk3_0
| ssItem(esk6_0) )
& ( nil = esk4_0
| cons(esk6_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk6_0,nil) = esk3_0 )
& ( nil = esk4_0
| memberP(esk4_0,esk6_0) )
& ( nil = esk3_0
| memberP(esk4_0,esk6_0) )
& ( nil = esk4_0
| ~ ssItem(X16)
| esk6_0 = X16
| ~ memberP(esk4_0,X16)
| ~ leq(esk6_0,X16) )
& ( nil = esk3_0
| ~ ssItem(X16)
| esk6_0 = X16
| ~ memberP(esk4_0,X16)
| ~ leq(esk6_0,X16) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_5,plain,
! [X52,X53] :
( ~ ssList(X52)
| ~ ssItem(X53)
| cons(X53,X52) != X52 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
cnf(c_0_6,negated_conjecture,
( nil != esk2_0
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( nil = esk4_0
| cons(esk6_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_12,negated_conjecture,
( nil = esk4_0
| ssItem(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( esk3_0 != nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( nil = esk3_0
| esk6_0 = X1
| ~ ssItem(X1)
| ~ memberP(esk4_0,X1)
| ~ leq(esk6_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
esk3_0 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),c_0_12]),c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( leq(X1,esk5_1(X1))
| ~ ssItem(X1)
| cons(X1,nil) != esk1_0
| ~ memberP(esk2_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( nil = esk3_0
| cons(esk6_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,negated_conjecture,
( nil = esk3_0
| memberP(esk4_0,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,negated_conjecture,
( nil = esk3_0
| ssItem(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_20,negated_conjecture,
( esk6_0 = X1
| ~ leq(esk6_0,X1)
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( leq(X1,esk5_1(X1))
| cons(X1,nil) != esk3_0
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_7]),c_0_8]) ).
cnf(c_0_22,negated_conjecture,
cons(esk6_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
memberP(esk4_0,esk6_0),
inference(sr,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_24,negated_conjecture,
ssItem(esk6_0),
inference(sr,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( memberP(esk2_0,esk5_1(X1))
| ~ ssItem(X1)
| cons(X1,nil) != esk1_0
| ~ memberP(esk2_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_26,negated_conjecture,
( esk5_1(esk6_0) = esk6_0
| ~ memberP(esk4_0,esk5_1(esk6_0))
| ~ ssItem(esk5_1(esk6_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
( memberP(esk4_0,esk5_1(X1))
| cons(X1,nil) != esk3_0
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_8]),c_0_7]),c_0_8]) ).
cnf(c_0_28,negated_conjecture,
( ssItem(esk5_1(X1))
| ~ ssItem(X1)
| cons(X1,nil) != esk1_0
| ~ memberP(esk2_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_29,negated_conjecture,
( X1 != esk5_1(X1)
| ~ ssItem(X1)
| cons(X1,nil) != esk1_0
| ~ memberP(esk2_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_30,negated_conjecture,
( esk5_1(esk6_0) = esk6_0
| ~ ssItem(esk5_1(esk6_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_31,negated_conjecture,
( ssItem(esk5_1(X1))
| cons(X1,nil) != esk3_0
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_7]),c_0_8]) ).
cnf(c_0_32,negated_conjecture,
( cons(X1,nil) != esk3_0
| esk5_1(X1) != X1
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_7]),c_0_8]) ).
cnf(c_0_33,negated_conjecture,
esk5_1(esk6_0) = esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_22]),c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC098+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n023.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 02:11:22 EDT 2023
% 0.16/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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/tmp/tmp.4U4jB1vA5x/E---3.1_3638.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # new_bool_3 with pid 3717 completed with status 0
% 0.16/0.44 # Result found by new_bool_3
% 0.16/0.44 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3720 completed with status 0
% 0.16/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.44 # Preprocessing time : 0.002 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 96
% 0.16/0.44 # Removed by relevancy pruning/SinE : 66
% 0.16/0.44 # Initial clauses : 64
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 64
% 0.16/0.44 # Processed clauses : 136
% 0.16/0.44 # ...of these trivial : 2
% 0.16/0.44 # ...subsumed : 7
% 0.16/0.44 # ...remaining for further processing : 127
% 0.16/0.44 # Other redundant clauses eliminated : 9
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 5
% 0.16/0.44 # Backward-rewritten : 1
% 0.16/0.44 # Generated clauses : 93
% 0.16/0.44 # ...of the previous two non-redundant : 72
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 2
% 0.16/0.44 # Paramodulations : 78
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 13
% 0.16/0.44 # Total rewrite steps : 89
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 54
% 0.16/0.44 # Positive orientable unit clauses : 17
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 3
% 0.16/0.44 # Non-unit-clauses : 34
% 0.16/0.44 # Current number of unprocessed clauses: 60
% 0.16/0.44 # ...number of literals in the above : 255
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 69
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 584
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 127
% 0.16/0.44 # Non-unit clause-clause subsumptions : 6
% 0.16/0.44 # Unit Clause-clause subsumption calls : 60
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 4
% 0.16/0.44 # BW rewrite match successes : 4
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 6842
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.010 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.013 s
% 0.16/0.44 # Maximum resident set size: 2028 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.014 s
% 0.16/0.44 # System time : 0.004 s
% 0.16/0.44 # Total time : 0.017 s
% 0.16/0.44 # Maximum resident set size: 1800 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------