TSTP Solution File: SWC415+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC415+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 123 ( 39 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 158 ( 61 ~; 58 |; 26 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 28 ( 0 sgn; 16 !; 4 ?)
% 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)
& X3 != X5
& tl(X4) = X5
& neq(nil,X4) )
| ? [X6] :
( ssList(X6)
& tl(X2) = X6
& X1 = X6
& neq(nil,X2) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.kglsCJJVYx/E---3.1_18435.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.kglsCJJVYx/E---3.1_18435.p',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.kglsCJJVYx/E---3.1_18435.p',ax17) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.kglsCJJVYx/E---3.1_18435.p',ax24) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X3 != X5
& tl(X4) = X5
& neq(nil,X4) )
| ? [X6] :
( ssList(X6)
& tl(X2) = X6
& X1 = X6
& neq(nil,X2) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_5,negated_conjecture,
! [X11,X12] :
( 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(X11)
| esk3_0 = X11
| tl(esk4_0) != X11
| ~ neq(nil,esk4_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X11)
| esk3_0 = X11
| tl(esk4_0) != X11
| ~ neq(nil,esk4_0) )
& ( neq(esk2_0,nil)
| ~ ssList(X12)
| tl(esk2_0) != X12
| esk1_0 != X12
| ~ neq(nil,esk2_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X12)
| tl(esk2_0) != X12
| esk1_0 != X12
| ~ neq(nil,esk2_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_4])])])])]) ).
cnf(c_0_6,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ ssList(X1)
| tl(esk2_0) != X1
| esk1_0 != X1
| ~ neq(nil,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( esk3_0 = X1
| ~ neq(esk4_0,nil)
| ~ ssList(X1)
| tl(esk4_0) != X1
| ~ neq(nil,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( tl(esk2_0) != esk1_0
| ~ ssList(tl(esk2_0))
| ~ neq(nil,esk2_0) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9])])]) ).
fof(c_0_13,plain,
! [X15,X16] :
( ( ~ neq(X15,X16)
| X15 != X16
| ~ ssList(X16)
| ~ ssList(X15) )
& ( X15 = X16
| neq(X15,X16)
| ~ ssList(X16)
| ~ ssList(X15) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ ssList(tl(esk2_0))
| ~ neq(nil,esk2_0) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[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_8]),c_0_8]),c_0_8]),c_0_9])])]),c_0_12]) ).
cnf(c_0_15,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ 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_5]) ).
cnf(c_0_17,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_18,plain,
! [X22] :
( ~ ssList(X22)
| nil = X22
| ssList(tl(X22)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_19,negated_conjecture,
( esk2_0 = nil
| ~ ssList(tl(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
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,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_9,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC415+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n009.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 01:45:30 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/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.kglsCJJVYx/E---3.1_18435.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # new_bool_1 with pid 18515 completed with status 0
% 0.15/0.43 # Result found by new_bool_1
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.15/0.43 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 18518 completed with status 0
% 0.15/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 96
% 0.15/0.43 # Removed by relevancy pruning/SinE : 67
% 0.15/0.43 # Initial clauses : 51
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 51
% 0.15/0.43 # Processed clauses : 93
% 0.15/0.43 # ...of these trivial : 5
% 0.15/0.43 # ...subsumed : 1
% 0.15/0.43 # ...remaining for further processing : 87
% 0.15/0.43 # Other redundant clauses eliminated : 6
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 2
% 0.15/0.43 # Backward-rewritten : 5
% 0.15/0.43 # Generated clauses : 17
% 0.15/0.43 # ...of the previous two non-redundant : 14
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 1
% 0.15/0.43 # Paramodulations : 12
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 6
% 0.15/0.43 # Total rewrite steps : 38
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 30
% 0.15/0.43 # Positive orientable unit clauses : 9
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 1
% 0.15/0.43 # Non-unit-clauses : 20
% 0.15/0.43 # Current number of unprocessed clauses: 16
% 0.15/0.43 # ...number of literals in the above : 65
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 52
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 217
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 101
% 0.15/0.43 # Non-unit clause-clause subsumptions : 4
% 0.15/0.43 # Unit Clause-clause subsumption calls : 24
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 1
% 0.15/0.43 # BW rewrite match successes : 1
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 4671
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.008 s
% 0.15/0.43 # System time : 0.001 s
% 0.15/0.43 # Total time : 0.009 s
% 0.15/0.43 # Maximum resident set size: 1916 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.011 s
% 0.15/0.43 # System time : 0.002 s
% 0.15/0.43 # Total time : 0.013 s
% 0.15/0.43 # Maximum resident set size: 1800 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------