TSTP Solution File: SWC373+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC373+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:26:09 EDT 2024
% Result : Theorem 0.15s 0.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 14 unt; 0 def)
% Number of atoms : 108 ( 20 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 132 ( 53 ~; 49 |; 15 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 21 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ rearsegP(X4,X3)
| segmentP(X2,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ rearsegP(X4,X3)
| segmentP(X2,X1) ) ) ) ) ),
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
& rearsegP(esk4_0,esk3_0)
& ~ segmentP(esk2_0,esk1_0) ),
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,
! [X11,X12,X15,X16] :
( ( ssList(esk5_2(X11,X12))
| ~ segmentP(X11,X12)
| ~ ssList(X12)
| ~ ssList(X11) )
& ( ssList(esk6_2(X11,X12))
| ~ segmentP(X11,X12)
| ~ ssList(X12)
| ~ ssList(X11) )
& ( app(app(esk5_2(X11,X12),X12),esk6_2(X11,X12)) = X11
| ~ segmentP(X11,X12)
| ~ ssList(X12)
| ~ ssList(X11) )
& ( ~ ssList(X15)
| ~ ssList(X16)
| app(app(X15,X12),X16) != X11
| segmentP(X11,X12)
| ~ ssList(X12)
| ~ ssList(X11) ) ),
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)],[ax7])])])])])]) ).
fof(c_0_8,plain,
! [X29,X30,X32] :
( ( ssList(esk7_2(X29,X30))
| ~ rearsegP(X29,X30)
| ~ ssList(X30)
| ~ ssList(X29) )
& ( app(esk7_2(X29,X30),X30) = X29
| ~ rearsegP(X29,X30)
| ~ ssList(X30)
| ~ ssList(X29) )
& ( ~ ssList(X32)
| app(X32,X30) != X29
| rearsegP(X29,X30)
| ~ ssList(X30)
| ~ ssList(X29) ) ),
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)],[ax6])])])])])]) ).
cnf(c_0_9,negated_conjecture,
rearsegP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( app(esk7_2(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
rearsegP(esk4_0,esk1_0),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( ssList(esk7_2(X1,X2))
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
app(esk7_2(esk4_0,esk1_0),esk1_0) = esk4_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_21,negated_conjecture,
ssList(esk7_2(esk4_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_16]),c_0_17])]) ).
fof(c_0_22,plain,
! [X76] :
( ~ ssList(X76)
| app(X76,nil) = X76 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_23,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
( segmentP(app(esk4_0,X1),esk1_0)
| ~ ssList(app(esk4_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]),c_0_21])]) ).
cnf(c_0_25,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_27,negated_conjecture,
~ segmentP(esk4_0,esk1_0),
inference(rw,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17]),c_0_26])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SWC373+1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n013.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 : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 03:43:08 EDT 2024
% 0.15/0.31 % CPUTime :
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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.15/0.47 # Version: 3.1.0
% 0.15/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 # Starting sh5l with 300s (1) cores
% 0.15/0.47 # sh5l with pid 5511 completed with status 0
% 0.15/0.47 # Result found by sh5l
% 0.15/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 # Starting sh5l with 300s (1) cores
% 0.15/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.47 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/0.47 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.15/0.47 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 5515 completed with status 0
% 0.15/0.47 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.15/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 # Starting sh5l with 300s (1) cores
% 0.15/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.47 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/0.47 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.15/0.47 # Preprocessing time : 0.002 s
% 0.15/0.47 # Presaturation interreduction done
% 0.15/0.47
% 0.15/0.47 # Proof found!
% 0.15/0.47 # SZS status Theorem
% 0.15/0.47 # SZS output start CNFRefutation
% See solution above
% 0.15/0.47 # Parsed axioms : 96
% 0.15/0.47 # Removed by relevancy pruning/SinE : 18
% 0.15/0.47 # Initial clauses : 156
% 0.15/0.47 # Removed in clause preprocessing : 2
% 0.15/0.47 # Initial clauses in saturation : 154
% 0.15/0.47 # Processed clauses : 357
% 0.15/0.47 # ...of these trivial : 2
% 0.15/0.47 # ...subsumed : 20
% 0.15/0.47 # ...remaining for further processing : 335
% 0.15/0.47 # Other redundant clauses eliminated : 33
% 0.15/0.47 # Clauses deleted for lack of memory : 0
% 0.15/0.47 # Backward-subsumed : 2
% 0.15/0.47 # Backward-rewritten : 0
% 0.15/0.47 # Generated clauses : 316
% 0.15/0.47 # ...of the previous two non-redundant : 260
% 0.15/0.47 # ...aggressively subsumed : 0
% 0.15/0.47 # Contextual simplify-reflections : 2
% 0.15/0.47 # Paramodulations : 279
% 0.15/0.47 # Factorizations : 0
% 0.15/0.47 # NegExts : 0
% 0.15/0.47 # Equation resolutions : 38
% 0.15/0.47 # Disequality decompositions : 0
% 0.15/0.47 # Total rewrite steps : 173
% 0.15/0.47 # ...of those cached : 163
% 0.15/0.47 # Propositional unsat checks : 0
% 0.15/0.47 # Propositional check models : 0
% 0.15/0.47 # Propositional check unsatisfiable : 0
% 0.15/0.47 # Propositional clauses : 0
% 0.15/0.47 # Propositional clauses after purity: 0
% 0.15/0.47 # Propositional unsat core size : 0
% 0.15/0.47 # Propositional preprocessing time : 0.000
% 0.15/0.47 # Propositional encoding time : 0.000
% 0.15/0.47 # Propositional solver time : 0.000
% 0.15/0.47 # Success case prop preproc time : 0.000
% 0.15/0.47 # Success case prop encoding time : 0.000
% 0.15/0.47 # Success case prop solver time : 0.000
% 0.15/0.47 # Current number of processed clauses : 169
% 0.15/0.47 # Positive orientable unit clauses : 24
% 0.15/0.47 # Positive unorientable unit clauses: 0
% 0.15/0.47 # Negative unit clauses : 2
% 0.15/0.47 # Non-unit-clauses : 143
% 0.15/0.47 # Current number of unprocessed clauses: 205
% 0.15/0.47 # ...number of literals in the above : 1111
% 0.15/0.47 # Current number of archived formulas : 0
% 0.15/0.47 # Current number of archived clauses : 150
% 0.15/0.47 # Clause-clause subsumption calls (NU) : 9353
% 0.15/0.47 # Rec. Clause-clause subsumption calls : 2400
% 0.15/0.47 # Non-unit clause-clause subsumptions : 24
% 0.15/0.47 # Unit Clause-clause subsumption calls : 8
% 0.15/0.47 # Rewrite failures with RHS unbound : 0
% 0.15/0.47 # BW rewrite match attempts : 0
% 0.15/0.47 # BW rewrite match successes : 0
% 0.15/0.47 # Condensation attempts : 0
% 0.15/0.47 # Condensation successes : 0
% 0.15/0.47 # Termbank termtop insertions : 20583
% 0.15/0.47 # Search garbage collected termcells : 3438
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.024 s
% 0.15/0.47 # System time : 0.004 s
% 0.15/0.47 # Total time : 0.028 s
% 0.15/0.47 # Maximum resident set size: 2348 pages
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.029 s
% 0.15/0.47 # System time : 0.004 s
% 0.15/0.47 # Total time : 0.033 s
% 0.15/0.47 # Maximum resident set size: 1816 pages
% 0.15/0.47 % E---3.1 exiting
% 0.43/1.03 % E exiting
%------------------------------------------------------------------------------