TSTP Solution File: SWC320+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC320+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:25 EDT 2023
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 32 ( 8 unt; 0 def)
% Number of atoms : 136 ( 65 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 168 ( 64 ~; 66 |; 27 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn; 18 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X3
| app(X6,cons(X5,nil)) != X4 ) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(cons(X7,nil),X8) = X1
& app(X8,cons(X7,nil)) = X2 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PhjYBTHhzf/E---3.1_5935.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PhjYBTHhzf/E---3.1_5935.p',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.PhjYBTHhzf/E---3.1_5935.p',ax17) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X3
| app(X6,cons(X5,nil)) != X4 ) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(cons(X7,nil),X8) = X1
& app(X8,cons(X7,nil)) = X2 ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_4,negated_conjecture,
! [X15,X16] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssItem(esk5_0)
| ~ neq(esk4_0,nil) )
& ( ssList(esk6_0)
| ~ neq(esk4_0,nil) )
& ( app(cons(esk5_0,nil),esk6_0) = esk3_0
| ~ neq(esk4_0,nil) )
& ( app(esk6_0,cons(esk5_0,nil)) = esk4_0
| ~ neq(esk4_0,nil) )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk1_0
| app(X16,cons(X15,nil)) != esk2_0
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk1_0
| app(X16,cons(X15,nil)) != esk2_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_3])])])])]) ).
cnf(c_0_5,negated_conjecture,
( neq(esk2_0,nil)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( nil = esk2_0
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != esk1_0
| app(X2,cons(X1,nil)) != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( esk4_0 = nil
| neq(esk4_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( ssList(esk6_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk1_0
| ~ neq(esk4_0,nil) ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
( esk4_0 = nil
| app(X1,cons(X2,nil)) != esk4_0
| app(cons(X2,nil),X1) != esk1_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_6]),c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = esk4_0
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( esk4_0 = nil
| ssItem(esk5_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_19,negated_conjecture,
( esk4_0 = nil
| ssList(esk6_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( app(cons(esk5_0,nil),esk6_0) = esk1_0
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
fof(c_0_21,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_22,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_23,negated_conjecture,
( esk1_0 = nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_24,negated_conjecture,
esk4_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20]) ).
cnf(c_0_25,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( neq(esk4_0,nil)
| esk1_0 != nil ),
inference(rw,[status(thm)],[c_0_22,c_0_6]) ).
cnf(c_0_27,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_24]),c_0_27])]) ).
cnf(c_0_30,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC320+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n012.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 01:39:05 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/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.PhjYBTHhzf/E---3.1_5935.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # new_bool_3 with pid 6048 completed with status 0
% 0.20/0.52 # Result found by new_bool_3
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 6051 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.20/0.52 # Preprocessing time : 0.002 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 96
% 0.20/0.52 # Removed by relevancy pruning/SinE : 77
% 0.20/0.52 # Initial clauses : 42
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 42
% 0.20/0.52 # Processed clauses : 117
% 0.20/0.52 # ...of these trivial : 2
% 0.20/0.52 # ...subsumed : 14
% 0.20/0.52 # ...remaining for further processing : 101
% 0.20/0.52 # Other redundant clauses eliminated : 12
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 1
% 0.20/0.52 # Backward-rewritten : 22
% 0.20/0.52 # Generated clauses : 124
% 0.20/0.52 # ...of the previous two non-redundant : 109
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 14
% 0.20/0.52 # Paramodulations : 109
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 16
% 0.20/0.52 # Total rewrite steps : 85
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 35
% 0.20/0.52 # Positive orientable unit clauses : 9
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 1
% 0.20/0.52 # Non-unit-clauses : 25
% 0.20/0.52 # Current number of unprocessed clauses: 73
% 0.20/0.52 # ...number of literals in the above : 378
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 63
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 390
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 135
% 0.20/0.52 # Non-unit clause-clause subsumptions : 29
% 0.20/0.52 # Unit Clause-clause subsumption calls : 22
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 2
% 0.20/0.52 # BW rewrite match successes : 2
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 5599
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.012 s
% 0.20/0.52 # System time : 0.001 s
% 0.20/0.52 # Total time : 0.013 s
% 0.20/0.52 # Maximum resident set size: 1880 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.017 s
% 0.20/0.52 # System time : 0.002 s
% 0.20/0.52 # Total time : 0.019 s
% 0.20/0.52 # Maximum resident set size: 1800 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------