TSTP Solution File: SWC206+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC206+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:24:23 EDT 2024
% Result : Theorem 0.37s 0.54s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 17 unt; 0 def)
% Number of atoms : 119 ( 27 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 133 ( 50 ~; 45 |; 18 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 28 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| neq(X1,nil)
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ segmentP(X4,X5)
| ~ segmentP(X3,X5) ) )
& neq(X4,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax54,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X1) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax54) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| neq(X1,nil)
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ segmentP(X4,X5)
| ~ segmentP(X3,X5) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_6,negated_conjecture,
( 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(esk1_0,nil)
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssList(esk5_0)
| ~ neq(esk4_0,nil) )
& ( neq(esk5_0,nil)
| ~ neq(esk4_0,nil) )
& ( segmentP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) )
& ( segmentP(esk3_0,esk5_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_5])])])])]) ).
fof(c_0_7,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_8,negated_conjecture,
neq(esk2_0,nil),
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,
! [X14,X15] :
( ( ~ neq(X14,X15)
| X14 != X15
| ~ ssList(X15)
| ~ ssList(X14) )
& ( X14 = X15
| neq(X14,X15)
| ~ ssList(X15)
| ~ ssList(X14) ) ),
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_7])])])])]) ).
fof(c_0_11,plain,
! [X30,X31] :
( ~ ssList(X30)
| ~ ssList(X31)
| ~ segmentP(X30,X31)
| ~ segmentP(X31,X30)
| X30 = X31 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax54])])])]) ).
cnf(c_0_12,negated_conjecture,
( segmentP(esk3_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( ssList(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_19,negated_conjecture,
~ neq(esk1_0,nil),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,plain,
( X1 = X2
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
segmentP(esk3_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_13])]) ).
cnf(c_0_24,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
~ neq(esk3_0,nil),
inference(rw,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_26,negated_conjecture,
( esk5_0 = esk3_0
| ~ segmentP(esk5_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_27,negated_conjecture,
esk3_0 = nil,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_22]),c_0_25]) ).
fof(c_0_28,plain,
! [X37] :
( ~ ssList(X37)
| segmentP(X37,nil) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
cnf(c_0_29,negated_conjecture,
( neq(esk5_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
( esk5_0 = nil
| ~ segmentP(esk5_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_27]) ).
cnf(c_0_31,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
neq(esk5_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_13])]) ).
cnf(c_0_33,negated_conjecture,
esk5_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_23])]) ).
cnf(c_0_34,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC206+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n007.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 : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 02:50:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.52 Running first-order theorem proving
% 0.21/0.52 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/benchmark/theBenchmark.p
% 0.37/0.54 # Version: 3.1.0
% 0.37/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.54 # Starting sh5l with 300s (1) cores
% 0.37/0.54 # new_bool_3 with pid 423 completed with status 0
% 0.37/0.54 # Result found by new_bool_3
% 0.37/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.54 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.37/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.37/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 426 completed with status 0
% 0.37/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.37/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.54 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.37/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.37/0.54 # Preprocessing time : 0.002 s
% 0.37/0.54 # Presaturation interreduction done
% 0.37/0.54
% 0.37/0.54 # Proof found!
% 0.37/0.54 # SZS status Theorem
% 0.37/0.54 # SZS output start CNFRefutation
% See solution above
% 0.37/0.54 # Parsed axioms : 96
% 0.37/0.54 # Removed by relevancy pruning/SinE : 70
% 0.37/0.54 # Initial clauses : 51
% 0.37/0.54 # Removed in clause preprocessing : 0
% 0.37/0.54 # Initial clauses in saturation : 51
% 0.37/0.54 # Processed clauses : 147
% 0.37/0.54 # ...of these trivial : 2
% 0.37/0.54 # ...subsumed : 4
% 0.37/0.54 # ...remaining for further processing : 141
% 0.37/0.54 # Other redundant clauses eliminated : 12
% 0.37/0.54 # Clauses deleted for lack of memory : 0
% 0.37/0.54 # Backward-subsumed : 6
% 0.37/0.54 # Backward-rewritten : 24
% 0.37/0.54 # Generated clauses : 224
% 0.37/0.54 # ...of the previous two non-redundant : 204
% 0.37/0.54 # ...aggressively subsumed : 0
% 0.37/0.54 # Contextual simplify-reflections : 1
% 0.37/0.54 # Paramodulations : 209
% 0.37/0.54 # Factorizations : 0
% 0.37/0.54 # NegExts : 0
% 0.37/0.54 # Equation resolutions : 16
% 0.37/0.54 # Disequality decompositions : 0
% 0.37/0.54 # Total rewrite steps : 132
% 0.37/0.54 # ...of those cached : 118
% 0.37/0.54 # Propositional unsat checks : 0
% 0.37/0.54 # Propositional check models : 0
% 0.37/0.54 # Propositional check unsatisfiable : 0
% 0.37/0.54 # Propositional clauses : 0
% 0.37/0.54 # Propositional clauses after purity: 0
% 0.37/0.54 # Propositional unsat core size : 0
% 0.37/0.54 # Propositional preprocessing time : 0.000
% 0.37/0.54 # Propositional encoding time : 0.000
% 0.37/0.54 # Propositional solver time : 0.000
% 0.37/0.54 # Success case prop preproc time : 0.000
% 0.37/0.54 # Success case prop encoding time : 0.000
% 0.37/0.54 # Success case prop solver time : 0.000
% 0.37/0.54 # Current number of processed clauses : 57
% 0.37/0.54 # Positive orientable unit clauses : 16
% 0.37/0.54 # Positive unorientable unit clauses: 0
% 0.37/0.54 # Negative unit clauses : 4
% 0.37/0.54 # Non-unit-clauses : 37
% 0.37/0.54 # Current number of unprocessed clauses: 154
% 0.37/0.54 # ...number of literals in the above : 705
% 0.37/0.54 # Current number of archived formulas : 0
% 0.37/0.54 # Current number of archived clauses : 79
% 0.37/0.54 # Clause-clause subsumption calls (NU) : 554
% 0.37/0.54 # Rec. Clause-clause subsumption calls : 223
% 0.37/0.54 # Non-unit clause-clause subsumptions : 4
% 0.37/0.54 # Unit Clause-clause subsumption calls : 52
% 0.37/0.54 # Rewrite failures with RHS unbound : 0
% 0.37/0.54 # BW rewrite match attempts : 2
% 0.37/0.54 # BW rewrite match successes : 2
% 0.37/0.54 # Condensation attempts : 0
% 0.37/0.54 # Condensation successes : 0
% 0.37/0.54 # Termbank termtop insertions : 8114
% 0.37/0.54 # Search garbage collected termcells : 1531
% 0.37/0.54
% 0.37/0.54 # -------------------------------------------------
% 0.37/0.54 # User time : 0.014 s
% 0.37/0.54 # System time : 0.002 s
% 0.37/0.54 # Total time : 0.016 s
% 0.37/0.54 # Maximum resident set size: 1908 pages
% 0.37/0.54
% 0.37/0.54 # -------------------------------------------------
% 0.37/0.54 # User time : 0.016 s
% 0.37/0.54 # System time : 0.006 s
% 0.37/0.54 # Total time : 0.022 s
% 0.37/0.54 # Maximum resident set size: 1824 pages
% 0.37/0.54 % E---3.1 exiting
% 0.37/0.55 % E exiting
%------------------------------------------------------------------------------