TSTP Solution File: SWC313+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC313+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:40:23 EDT 2023
% Result : Theorem 0.50s 0.54s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 9 unt; 0 def)
% Number of atoms : 168 ( 81 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 208 ( 78 ~; 84 |; 32 &)
% ( 1 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn; 22 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(X6,cons(X5,nil)) != X3
& app(cons(X5,nil),X6) = X4 ) )
| ( nil != X3
& nil = X4 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(cons(X7,nil),X8) = X2
& app(X8,cons(X7,nil)) = X1 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JDhPikgtk5/E---3.1_13665.p',co1) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.JDhPikgtk5/E---3.1_13665.p',ax81) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JDhPikgtk5/E---3.1_13665.p',ax20) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JDhPikgtk5/E---3.1_13665.p',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.JDhPikgtk5/E---3.1_13665.p',ax17) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(X6,cons(X5,nil)) != X3
& app(cons(X5,nil),X6) = X4 ) )
| ( nil != X3
& nil = X4 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(cons(X7,nil),X8) = X2
& app(X8,cons(X7,nil)) = X1 ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_6,negated_conjecture,
! [X13,X14,X15,X16] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( ~ ssItem(X13)
| ~ ssList(X14)
| app(X14,cons(X13,nil)) = esk3_0
| app(cons(X13,nil),X14) != esk4_0 )
& ( nil = esk3_0
| nil != esk4_0 )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk2_0
| app(X16,cons(X15,nil)) != esk1_0
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk2_0
| app(X16,cons(X15,nil)) != esk1_0
| nil != esk1_0 ) ),
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_5])])])])]) ).
cnf(c_0_7,negated_conjecture,
( app(X2,cons(X1,nil)) = esk3_0
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X29,X30] :
( ~ ssList(X29)
| ~ ssItem(X30)
| cons(X30,X29) = app(cons(X30,nil),X29) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_11,negated_conjecture,
( app(X1,cons(X2,nil)) = esk1_0
| app(cons(X2,nil),X1) != esk2_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_12,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X45] :
( ( ssList(esk5_1(X45))
| nil = X45
| ~ ssList(X45) )
& ( ssItem(esk6_1(X45))
| nil = X45
| ~ ssList(X45) )
& ( cons(esk6_1(X45),esk5_1(X45)) = X45
| nil = X45
| ~ ssList(X45) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).
cnf(c_0_14,negated_conjecture,
( app(X1,cons(X2,nil)) = esk1_0
| cons(X2,X1) != esk2_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( cons(esk6_1(X1),esk5_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( app(esk5_1(esk2_0),cons(esk6_1(esk2_0),nil)) = esk1_0
| esk2_0 = nil
| ~ ssList(esk5_1(esk2_0))
| ~ ssItem(esk6_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15])]),c_0_16])]) ).
cnf(c_0_18,plain,
( ssItem(esk6_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( app(esk5_1(esk2_0),cons(esk6_1(esk2_0),nil)) = esk1_0
| esk2_0 = nil
| ~ ssList(esk5_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16])]) ).
cnf(c_0_20,plain,
( ssList(esk5_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( nil = esk2_0
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != esk2_0
| app(X2,cons(X1,nil)) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
( app(esk5_1(esk2_0),cons(esk6_1(esk2_0),nil)) = esk1_0
| esk2_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16])]) ).
cnf(c_0_23,negated_conjecture,
( esk2_0 = nil
| app(cons(esk6_1(esk2_0),nil),esk5_1(esk2_0)) != esk2_0
| ~ ssList(esk5_1(esk2_0))
| ~ ssItem(esk6_1(esk2_0)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( esk2_0 = nil
| cons(esk6_1(esk2_0),esk5_1(esk2_0)) != esk2_0
| ~ ssList(esk5_1(esk2_0))
| ~ ssItem(esk6_1(esk2_0)) ),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_25,negated_conjecture,
( esk2_0 = nil
| ~ ssList(esk5_1(esk2_0))
| ~ ssItem(esk6_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_15]),c_0_16])]) ).
cnf(c_0_26,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,negated_conjecture,
( esk2_0 = nil
| ~ ssList(esk5_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_18]),c_0_16])]) ).
fof(c_0_28,plain,
! [X54,X55] :
( ( ~ neq(X54,X55)
| X54 != X55
| ~ ssList(X55)
| ~ ssList(X54) )
& ( X54 = X55
| neq(X54,X55)
| ~ ssList(X55)
| ~ ssList(X54) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_29,negated_conjecture,
( esk1_0 = nil
| esk2_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_8]),c_0_9]) ).
cnf(c_0_30,negated_conjecture,
esk2_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_16])]) ).
cnf(c_0_31,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_33,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_30]),c_0_33])]) ).
cnf(c_0_36,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC313+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 02:07:37 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.JDhPikgtk5/E---3.1_13665.p
% 0.50/0.54 # Version: 3.1pre001
% 0.50/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.50/0.54 # Starting sh5l with 300s (1) cores
% 0.50/0.54 # new_bool_1 with pid 13789 completed with status 0
% 0.50/0.54 # Result found by new_bool_1
% 0.50/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.50/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.50/0.54 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.50/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.50/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.50/0.54 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 13794 completed with status 0
% 0.50/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.50/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.50/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.50/0.54 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.50/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.50/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.50/0.54 # Preprocessing time : 0.002 s
% 0.50/0.54 # Presaturation interreduction done
% 0.50/0.54
% 0.50/0.54 # Proof found!
% 0.50/0.54 # SZS status Theorem
% 0.50/0.54 # SZS output start CNFRefutation
% See solution above
% 0.50/0.54 # Parsed axioms : 96
% 0.50/0.54 # Removed by relevancy pruning/SinE : 77
% 0.50/0.54 # Initial clauses : 39
% 0.50/0.54 # Removed in clause preprocessing : 0
% 0.50/0.54 # Initial clauses in saturation : 39
% 0.50/0.54 # Processed clauses : 326
% 0.50/0.54 # ...of these trivial : 2
% 0.50/0.54 # ...subsumed : 156
% 0.50/0.54 # ...remaining for further processing : 168
% 0.50/0.54 # Other redundant clauses eliminated : 15
% 0.50/0.54 # Clauses deleted for lack of memory : 0
% 0.50/0.54 # Backward-subsumed : 16
% 0.50/0.54 # Backward-rewritten : 41
% 0.50/0.54 # Generated clauses : 549
% 0.50/0.54 # ...of the previous two non-redundant : 484
% 0.50/0.54 # ...aggressively subsumed : 0
% 0.50/0.54 # Contextual simplify-reflections : 36
% 0.50/0.54 # Paramodulations : 531
% 0.50/0.54 # Factorizations : 0
% 0.50/0.54 # NegExts : 0
% 0.50/0.54 # Equation resolutions : 19
% 0.50/0.54 # Total rewrite steps : 393
% 0.50/0.54 # Propositional unsat checks : 0
% 0.50/0.54 # Propositional check models : 0
% 0.50/0.54 # Propositional check unsatisfiable : 0
% 0.50/0.54 # Propositional clauses : 0
% 0.50/0.54 # Propositional clauses after purity: 0
% 0.50/0.54 # Propositional unsat core size : 0
% 0.50/0.54 # Propositional preprocessing time : 0.000
% 0.50/0.54 # Propositional encoding time : 0.000
% 0.50/0.54 # Propositional solver time : 0.000
% 0.50/0.54 # Success case prop preproc time : 0.000
% 0.50/0.54 # Success case prop encoding time : 0.000
% 0.50/0.54 # Success case prop solver time : 0.000
% 0.50/0.54 # Current number of processed clauses : 71
% 0.50/0.54 # Positive orientable unit clauses : 9
% 0.50/0.54 # Positive unorientable unit clauses: 0
% 0.50/0.54 # Negative unit clauses : 1
% 0.50/0.54 # Non-unit-clauses : 61
% 0.50/0.54 # Current number of unprocessed clauses: 232
% 0.50/0.54 # ...number of literals in the above : 1360
% 0.50/0.54 # Current number of archived formulas : 0
% 0.50/0.54 # Current number of archived clauses : 94
% 0.50/0.54 # Clause-clause subsumption calls (NU) : 3746
% 0.50/0.54 # Rec. Clause-clause subsumption calls : 859
% 0.50/0.54 # Non-unit clause-clause subsumptions : 208
% 0.50/0.54 # Unit Clause-clause subsumption calls : 25
% 0.50/0.54 # Rewrite failures with RHS unbound : 0
% 0.50/0.54 # BW rewrite match attempts : 2
% 0.50/0.54 # BW rewrite match successes : 2
% 0.50/0.54 # Condensation attempts : 0
% 0.50/0.54 # Condensation successes : 0
% 0.50/0.54 # Termbank termtop insertions : 13055
% 0.50/0.54
% 0.50/0.54 # -------------------------------------------------
% 0.50/0.54 # User time : 0.026 s
% 0.50/0.54 # System time : 0.002 s
% 0.50/0.54 # Total time : 0.028 s
% 0.50/0.54 # Maximum resident set size: 1884 pages
% 0.50/0.54
% 0.50/0.54 # -------------------------------------------------
% 0.50/0.54 # User time : 0.031 s
% 0.50/0.54 # System time : 0.003 s
% 0.50/0.54 # Total time : 0.034 s
% 0.50/0.54 # Maximum resident set size: 1800 pages
% 0.50/0.54 % E---3.1 exiting
% 0.50/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------