TSTP Solution File: SWC416+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC416+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:55 EDT 2023
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 14 unt; 0 def)
% Number of atoms : 162 ( 51 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 203 ( 79 ~; 73 |; 30 &)
% ( 1 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 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; 6 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn; 33 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X2 = X5
& ? [X6] :
( ssList(X6)
& app(X6,X1) = X5
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X2) = X7
& neq(nil,X2) ) ) )
| ! [X8] :
( ssItem(X8)
=> app(cons(X8,nil),X3) != X4 ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Y4wQQ8mTMx/E---3.1_29998.p',co1) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Y4wQQ8mTMx/E---3.1_29998.p',ax81) ).
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.Y4wQQ8mTMx/E---3.1_29998.p',ax23) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Y4wQQ8mTMx/E---3.1_29998.p',ax21) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Y4wQQ8mTMx/E---3.1_29998.p',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.Y4wQQ8mTMx/E---3.1_29998.p',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Y4wQQ8mTMx/E---3.1_29998.p',ax16) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X2 = X5
& ? [X6] :
( ssList(X6)
& app(X6,X1) = X5
& ? [X7] :
( ssItem(X7)
& cons(X7,nil) = X6
& hd(X2) = X7
& neq(nil,X2) ) ) )
| ! [X8] :
( ssItem(X8)
=> app(cons(X8,nil),X3) != X4 ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_8,negated_conjecture,
! [X13,X14,X15] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ~ ssList(X13)
| esk2_0 != X13
| ~ ssList(X14)
| app(X14,esk1_0) != X13
| ~ ssItem(X15)
| cons(X15,nil) != X14
| hd(esk2_0) != X15
| ~ neq(nil,esk2_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X13)
| esk2_0 != X13
| ~ ssList(X14)
| app(X14,esk1_0) != X13
| ~ ssItem(X15)
| cons(X15,nil) != X14
| hd(esk2_0) != X15
| ~ neq(nil,esk2_0) )
& ( neq(esk2_0,nil)
| ssItem(esk5_0) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk5_0) )
& ( neq(esk2_0,nil)
| app(cons(esk5_0,nil),esk3_0) = esk4_0 )
& ( ~ neq(esk4_0,nil)
| app(cons(esk5_0,nil),esk3_0) = esk4_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_7])])])])]) ).
cnf(c_0_9,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_10,negated_conjecture,
( app(cons(esk5_0,nil),esk3_0) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X38,X39] :
( ~ ssList(X38)
| ~ ssItem(X39)
| cons(X39,X38) = app(cons(X39,nil),X38) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_15,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_16,plain,
! [X57,X58] :
( ~ ssList(X57)
| ~ ssItem(X58)
| hd(cons(X58,X57)) = X58 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])]) ).
cnf(c_0_17,negated_conjecture,
app(cons(esk5_0,nil),esk1_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_12]),c_0_13])]) ).
cnf(c_0_18,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_12]),c_0_13])]) ).
cnf(c_0_21,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ ssList(X1)
| esk2_0 != X1
| ~ ssList(X2)
| app(X2,esk1_0) != X1
| ~ ssItem(X3)
| cons(X3,nil) != X2
| hd(esk2_0) != X3
| ~ neq(nil,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
( hd(cons(X2,X1)) = X2
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
cons(esk5_0,esk1_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
fof(c_0_24,plain,
! [X24,X25] :
( ~ ssList(X24)
| ~ ssItem(X25)
| nil != cons(X25,X24) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])]) ).
cnf(c_0_25,negated_conjecture,
( app(cons(hd(esk2_0),nil),esk1_0) != esk2_0
| ~ ssList(app(cons(hd(esk2_0),nil),esk1_0))
| ~ ssList(cons(hd(esk2_0),nil))
| ~ neq(nil,esk2_0)
| ~ ssItem(hd(esk2_0)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_12]),c_0_13])])])])]) ).
cnf(c_0_26,negated_conjecture,
hd(esk2_0) = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19]),c_0_20])]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_28,plain,
! [X19,X20] :
( ( ~ neq(X19,X20)
| X19 != X20
| ~ ssList(X20)
| ~ ssList(X19) )
& ( X19 = X20
| neq(X19,X20)
| ~ ssList(X20)
| ~ ssList(X19) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| ~ neq(nil,esk2_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(rw,[status(thm)],[c_0_25,c_0_26]),c_0_17]),c_0_26]),c_0_17]),c_0_27]),c_0_26]),c_0_26]),c_0_20])]) ).
cnf(c_0_31,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_33,negated_conjecture,
esk2_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_23]),c_0_19]),c_0_20])]) ).
fof(c_0_34,plain,
! [X46,X47] :
( ~ ssList(X46)
| ~ ssItem(X47)
| ssList(cons(X47,X46)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_35,negated_conjecture,
~ ssList(cons(esk5_0,nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_27]),c_0_32])]),c_0_33]) ).
cnf(c_0_36,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_32]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SWC416+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n008.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:08:13 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Y4wQQ8mTMx/E---3.1_29998.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 30077 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-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.16/0.44 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 30080 completed with status 0
% 0.16/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 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-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (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 : 67
% 0.16/0.44 # Initial clauses : 53
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 53
% 0.16/0.44 # Processed clauses : 120
% 0.16/0.44 # ...of these trivial : 6
% 0.16/0.44 # ...subsumed : 6
% 0.16/0.44 # ...remaining for further processing : 108
% 0.16/0.44 # Other redundant clauses eliminated : 21
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 3
% 0.16/0.44 # Backward-rewritten : 2
% 0.16/0.44 # Generated clauses : 110
% 0.16/0.44 # ...of the previous two non-redundant : 73
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 2
% 0.16/0.44 # Paramodulations : 87
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 26
% 0.16/0.44 # Total rewrite steps : 99
% 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 : 52
% 0.16/0.44 # Positive orientable unit clauses : 14
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 4
% 0.16/0.44 # Non-unit-clauses : 34
% 0.16/0.44 # Current number of unprocessed clauses: 53
% 0.16/0.44 # ...number of literals in the above : 268
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 52
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 387
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 121
% 0.16/0.44 # Non-unit clause-clause subsumptions : 7
% 0.16/0.44 # Unit Clause-clause subsumption calls : 26
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 1
% 0.16/0.44 # BW rewrite match successes : 1
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 6138
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.009 s
% 0.16/0.44 # System time : 0.002 s
% 0.16/0.44 # Total time : 0.011 s
% 0.16/0.44 # Maximum resident set size: 1916 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.013 s
% 0.16/0.44 # System time : 0.002 s
% 0.16/0.44 # Total time : 0.015 s
% 0.16/0.44 # Maximum resident set size: 1796 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------