TSTP Solution File: SWC116+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC116+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:23:31 EDT 2024
% Result : Theorem 0.12s 0.41s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 96 ( 33 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 114 ( 44 ~; 37 |; 19 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 17 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( nil = X2
& nil = X1 )
| ( neq(X1,nil)
& segmentP(X2,X1) )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ segmentP(X4,X3) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',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 )
| ( nil = X2
& nil = X1 )
| ( neq(X1,nil)
& segmentP(X2,X1) )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ segmentP(X4,X3) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_4,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_5,negated_conjecture,
( 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 )
& ( nil != esk2_0
| nil != esk1_0 )
& ( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0) )
& ( neq(esk3_0,nil)
| ~ neq(esk4_0,nil) )
& ( segmentP(esk4_0,esk3_0)
| ~ neq(esk4_0,nil) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_6,plain,
! [X31,X32] :
( ( ~ neq(X31,X32)
| X31 != X32
| ~ ssList(X32)
| ~ ssList(X31) )
& ( X31 = X32
| neq(X31,X32)
| ~ ssList(X32)
| ~ ssList(X31) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
cnf(c_0_7,negated_conjecture,
( nil != esk2_0
| nil != esk1_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(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( neq(esk3_0,nil)
| ~ neq(esk4_0,nil) ),
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,
( segmentP(esk4_0,esk3_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
( esk1_0 != nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( ~ segmentP(esk4_0,esk1_0)
| ~ neq(esk1_0,nil) ),
inference(rw,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_19,negated_conjecture,
( neq(esk1_0,nil)
| ~ neq(esk4_0,nil) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( segmentP(esk4_0,esk1_0)
| ~ neq(esk4_0,nil) ),
inference(rw,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_21,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_23,negated_conjecture,
esk4_0 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_11]),c_0_17]) ).
cnf(c_0_24,negated_conjecture,
~ neq(esk4_0,nil),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : SWC116+1 : TPTP v8.2.0. Released v2.4.0.
% 0.02/0.08 % Command : run_E %s %d THM
% 0.07/0.27 % Computer : n007.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Sun May 19 03:11:37 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.12/0.38 Running first-order theorem proving
% 0.12/0.38 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/benchmark/theBenchmark.p
% 0.12/0.41 # Version: 3.1.0
% 0.12/0.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.41 # Starting sh5l with 300s (1) cores
% 0.12/0.41 # new_bool_3 with pid 27495 completed with status 0
% 0.12/0.41 # Result found by new_bool_3
% 0.12/0.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.41 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.12/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.12/0.41 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27498 completed with status 0
% 0.12/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.41 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.41 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.12/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.12/0.41 # Preprocessing time : 0.002 s
% 0.12/0.41 # Presaturation interreduction done
% 0.12/0.41
% 0.12/0.41 # Proof found!
% 0.12/0.41 # SZS status Theorem
% 0.12/0.41 # SZS output start CNFRefutation
% See solution above
% 0.12/0.41 # Parsed axioms : 96
% 0.12/0.41 # Removed by relevancy pruning/SinE : 70
% 0.12/0.41 # Initial clauses : 49
% 0.12/0.41 # Removed in clause preprocessing : 0
% 0.12/0.41 # Initial clauses in saturation : 49
% 0.12/0.41 # Processed clauses : 114
% 0.12/0.41 # ...of these trivial : 2
% 0.12/0.41 # ...subsumed : 1
% 0.12/0.41 # ...remaining for further processing : 111
% 0.12/0.41 # Other redundant clauses eliminated : 10
% 0.12/0.41 # Clauses deleted for lack of memory : 0
% 0.12/0.41 # Backward-subsumed : 3
% 0.12/0.41 # Backward-rewritten : 0
% 0.12/0.41 # Generated clauses : 123
% 0.12/0.41 # ...of the previous two non-redundant : 104
% 0.12/0.41 # ...aggressively subsumed : 0
% 0.12/0.41 # Contextual simplify-reflections : 2
% 0.12/0.41 # Paramodulations : 110
% 0.12/0.41 # Factorizations : 0
% 0.12/0.41 # NegExts : 0
% 0.12/0.41 # Equation resolutions : 14
% 0.12/0.41 # Disequality decompositions : 0
% 0.12/0.41 # Total rewrite steps : 36
% 0.12/0.41 # ...of those cached : 31
% 0.12/0.41 # Propositional unsat checks : 0
% 0.12/0.41 # Propositional check models : 0
% 0.12/0.41 # Propositional check unsatisfiable : 0
% 0.12/0.41 # Propositional clauses : 0
% 0.12/0.41 # Propositional clauses after purity: 0
% 0.12/0.41 # Propositional unsat core size : 0
% 0.12/0.41 # Propositional preprocessing time : 0.000
% 0.12/0.41 # Propositional encoding time : 0.000
% 0.12/0.41 # Propositional solver time : 0.000
% 0.12/0.41 # Success case prop preproc time : 0.000
% 0.12/0.41 # Success case prop encoding time : 0.000
% 0.12/0.41 # Success case prop solver time : 0.000
% 0.12/0.41 # Current number of processed clauses : 57
% 0.12/0.41 # Positive orientable unit clauses : 12
% 0.12/0.41 # Positive unorientable unit clauses: 0
% 0.12/0.41 # Negative unit clauses : 3
% 0.12/0.41 # Non-unit-clauses : 42
% 0.12/0.41 # Current number of unprocessed clauses: 80
% 0.12/0.41 # ...number of literals in the above : 336
% 0.12/0.41 # Current number of archived formulas : 0
% 0.12/0.41 # Current number of archived clauses : 49
% 0.12/0.41 # Clause-clause subsumption calls (NU) : 314
% 0.12/0.41 # Rec. Clause-clause subsumption calls : 111
% 0.12/0.41 # Non-unit clause-clause subsumptions : 3
% 0.12/0.41 # Unit Clause-clause subsumption calls : 10
% 0.12/0.41 # Rewrite failures with RHS unbound : 0
% 0.12/0.41 # BW rewrite match attempts : 0
% 0.12/0.41 # BW rewrite match successes : 0
% 0.12/0.41 # Condensation attempts : 0
% 0.12/0.41 # Condensation successes : 0
% 0.12/0.41 # Termbank termtop insertions : 6584
% 0.12/0.41 # Search garbage collected termcells : 1520
% 0.12/0.41
% 0.12/0.41 # -------------------------------------------------
% 0.12/0.41 # User time : 0.012 s
% 0.12/0.41 # System time : 0.001 s
% 0.12/0.41 # Total time : 0.013 s
% 0.12/0.41 # Maximum resident set size: 1904 pages
% 0.12/0.41
% 0.12/0.41 # -------------------------------------------------
% 0.12/0.41 # User time : 0.013 s
% 0.12/0.41 # System time : 0.005 s
% 0.12/0.41 # Total time : 0.018 s
% 0.12/0.41 # Maximum resident set size: 1820 pages
% 0.12/0.41 % E---3.1 exiting
% 0.12/0.41 % E exiting
%------------------------------------------------------------------------------