TSTP Solution File: SWC059+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC059+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:22:54 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 12 unt; 0 def)
% Number of atoms : 124 ( 38 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 147 ( 57 ~; 54 |; 25 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 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 : 19 ( 0 sgn 13 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ segmentP(X4,X3) ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ~ segmentP(X4,X3) ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_5,negated_conjecture,
! [X11] :
( 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 )
& ( neq(esk3_0,nil)
| ~ neq(esk4_0,nil) )
& ( segmentP(esk4_0,esk3_0)
| ~ neq(esk4_0,nil) )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk2_0,X11)
| ~ segmentP(esk1_0,X11)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk2_0,X11)
| ~ segmentP(esk1_0,X11)
| nil != esk1_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,
( segmentP(esk4_0,esk3_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( neq(esk3_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( segmentP(esk2_0,esk1_0)
| ~ neq(esk2_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_12,plain,
! [X29] :
( ( ~ segmentP(nil,X29)
| nil = X29
| ~ ssList(X29) )
& ( nil != X29
| segmentP(nil,X29)
| ~ ssList(X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
( neq(esk1_0,nil)
| ~ neq(esk2_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8]),c_0_7]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( segmentP(esk2_0,esk1_0)
| esk1_0 != nil ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_20,negated_conjecture,
( esk1_0 != nil
| ~ segmentP(esk1_0,esk1_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_11]),c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( esk1_0 = nil
| esk2_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_8]),c_0_7]) ).
cnf(c_0_22,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_18]),c_0_19])]) ).
cnf(c_0_23,negated_conjecture,
( neq(esk2_0,nil)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,negated_conjecture,
esk2_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
neq(esk2_0,nil),
inference(sr,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( esk2_0 = nil
| segmentP(esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( nil = esk2_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_28,negated_conjecture,
neq(esk1_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_25])]) ).
cnf(c_0_29,negated_conjecture,
segmentP(esk2_0,esk1_0),
inference(sr,[status(thm)],[c_0_26,c_0_24]) ).
fof(c_0_30,plain,
! [X23] :
( ~ ssList(X23)
| segmentP(X23,X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_31,negated_conjecture,
~ segmentP(esk1_0,esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_15])]),c_0_24]) ).
cnf(c_0_32,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC059+1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 03:16:37 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.19/0.49 # Version: 3.1.0
% 0.19/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # new_bool_3 with pid 25440 completed with status 0
% 0.19/0.49 # Result found by new_bool_3
% 0.19/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25443 completed with status 0
% 0.19/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.002 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 96
% 0.19/0.49 # Removed by relevancy pruning/SinE : 70
% 0.19/0.49 # Initial clauses : 51
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 51
% 0.19/0.49 # Processed clauses : 130
% 0.19/0.49 # ...of these trivial : 4
% 0.19/0.49 # ...subsumed : 1
% 0.19/0.49 # ...remaining for further processing : 125
% 0.19/0.49 # Other redundant clauses eliminated : 12
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 12
% 0.19/0.49 # Backward-rewritten : 2
% 0.19/0.49 # Generated clauses : 175
% 0.19/0.49 # ...of the previous two non-redundant : 150
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 2
% 0.19/0.49 # Paramodulations : 154
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 16
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 83
% 0.19/0.49 # ...of those cached : 75
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 51
% 0.19/0.49 # Positive orientable unit clauses : 12
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 4
% 0.19/0.49 # Non-unit-clauses : 35
% 0.19/0.49 # Current number of unprocessed clauses: 119
% 0.19/0.49 # ...number of literals in the above : 563
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 69
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 476
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 151
% 0.19/0.49 # Non-unit clause-clause subsumptions : 6
% 0.19/0.49 # Unit Clause-clause subsumption calls : 29
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 1
% 0.19/0.49 # BW rewrite match successes : 1
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 7594
% 0.19/0.49 # Search garbage collected termcells : 1567
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.015 s
% 0.19/0.49 # System time : 0.001 s
% 0.19/0.49 # Total time : 0.016 s
% 0.19/0.49 # Maximum resident set size: 2024 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.019 s
% 0.19/0.49 # System time : 0.003 s
% 0.19/0.49 # Total time : 0.022 s
% 0.19/0.49 # Maximum resident set size: 1824 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------