TSTP Solution File: SWC047+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC047+1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:22:47 EDT 2024
% Result : Theorem 0.22s 0.49s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 22 ( 9 unt; 0 def)
% Number of atoms : 87 ( 27 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 107 ( 42 ~; 38 |; 18 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 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 : 18 ( 0 sgn 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| X4 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& rearsegP(X2,X5)
& rearsegP(X1,X5) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax49,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax49) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| X4 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& rearsegP(X2,X5)
& rearsegP(X1,X5) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_3,negated_conjecture,
! [X11] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& esk4_0 = esk3_0
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ rearsegP(esk2_0,X11)
| ~ rearsegP(esk1_0,X11)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ rearsegP(esk2_0,X11)
| ~ rearsegP(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_2])])])])])]) ).
cnf(c_0_4,negated_conjecture,
esk4_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk2_0,X1)
| ~ rearsegP(esk1_0,X1)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( nil = esk2_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk2_0,X1)
| ~ rearsegP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
( esk2_0 != nil
| ~ rearsegP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8])]) ).
cnf(c_0_12,negated_conjecture,
( neq(esk2_0,nil)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
( neq(esk2_0,nil)
| esk2_0 != nil ),
inference(rw,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,negated_conjecture,
( ~ rearsegP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_8])]),c_0_11]) ).
cnf(c_0_16,negated_conjecture,
neq(esk2_0,nil),
inference(csr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk2_0),
inference(rw,[status(thm)],[c_0_14,c_0_8]) ).
fof(c_0_18,plain,
! [X21] :
( ~ ssList(X21)
| rearsegP(X21,X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])])]) ).
cnf(c_0_19,negated_conjecture,
~ rearsegP(esk2_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC047+1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n009.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sun May 19 03:51:23 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.22/0.47 Running first-order theorem proving
% 0.22/0.47 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.22/0.49 # Version: 3.1.0
% 0.22/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.49 # Starting sh5l with 300s (1) cores
% 0.22/0.49 # new_bool_3 with pid 25010 completed with status 0
% 0.22/0.49 # Result found by new_bool_3
% 0.22/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.49 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.22/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.22/0.49 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 25013 completed with status 0
% 0.22/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.22/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.49 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.22/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.22/0.49 # Preprocessing time : 0.002 s
% 0.22/0.49 # Presaturation interreduction done
% 0.22/0.49
% 0.22/0.49 # Proof found!
% 0.22/0.49 # SZS status Theorem
% 0.22/0.49 # SZS output start CNFRefutation
% See solution above
% 0.22/0.49 # Parsed axioms : 96
% 0.22/0.49 # Removed by relevancy pruning/SinE : 70
% 0.22/0.49 # Initial clauses : 48
% 0.22/0.49 # Removed in clause preprocessing : 0
% 0.22/0.49 # Initial clauses in saturation : 48
% 0.22/0.49 # Processed clauses : 73
% 0.22/0.49 # ...of these trivial : 3
% 0.22/0.49 # ...subsumed : 0
% 0.22/0.49 # ...remaining for further processing : 70
% 0.22/0.49 # Other redundant clauses eliminated : 6
% 0.22/0.49 # Clauses deleted for lack of memory : 0
% 0.22/0.49 # Backward-subsumed : 2
% 0.22/0.49 # Backward-rewritten : 1
% 0.22/0.49 # Generated clauses : 7
% 0.22/0.49 # ...of the previous two non-redundant : 7
% 0.22/0.49 # ...aggressively subsumed : 0
% 0.22/0.49 # Contextual simplify-reflections : 3
% 0.22/0.49 # Paramodulations : 2
% 0.22/0.49 # Factorizations : 0
% 0.22/0.49 # NegExts : 0
% 0.22/0.49 # Equation resolutions : 6
% 0.22/0.49 # Disequality decompositions : 0
% 0.22/0.49 # Total rewrite steps : 18
% 0.22/0.49 # ...of those cached : 12
% 0.22/0.49 # Propositional unsat checks : 0
% 0.22/0.49 # Propositional check models : 0
% 0.22/0.49 # Propositional check unsatisfiable : 0
% 0.22/0.49 # Propositional clauses : 0
% 0.22/0.49 # Propositional clauses after purity: 0
% 0.22/0.49 # Propositional unsat core size : 0
% 0.22/0.49 # Propositional preprocessing time : 0.000
% 0.22/0.49 # Propositional encoding time : 0.000
% 0.22/0.49 # Propositional solver time : 0.000
% 0.22/0.49 # Success case prop preproc time : 0.000
% 0.22/0.49 # Success case prop encoding time : 0.000
% 0.22/0.49 # Success case prop solver time : 0.000
% 0.22/0.49 # Current number of processed clauses : 19
% 0.22/0.49 # Positive orientable unit clauses : 10
% 0.22/0.49 # Positive unorientable unit clauses: 0
% 0.22/0.49 # Negative unit clauses : 2
% 0.22/0.49 # Non-unit-clauses : 7
% 0.22/0.49 # Current number of unprocessed clauses: 25
% 0.22/0.49 # ...number of literals in the above : 98
% 0.22/0.49 # Current number of archived formulas : 0
% 0.22/0.49 # Current number of archived clauses : 46
% 0.22/0.49 # Clause-clause subsumption calls (NU) : 256
% 0.22/0.49 # Rec. Clause-clause subsumption calls : 80
% 0.22/0.49 # Non-unit clause-clause subsumptions : 4
% 0.22/0.49 # Unit Clause-clause subsumption calls : 2
% 0.22/0.49 # Rewrite failures with RHS unbound : 0
% 0.22/0.49 # BW rewrite match attempts : 2
% 0.22/0.49 # BW rewrite match successes : 2
% 0.22/0.49 # Condensation attempts : 0
% 0.22/0.49 # Condensation successes : 0
% 0.22/0.49 # Termbank termtop insertions : 4836
% 0.22/0.49 # Search garbage collected termcells : 1489
% 0.22/0.49
% 0.22/0.49 # -------------------------------------------------
% 0.22/0.49 # User time : 0.007 s
% 0.22/0.49 # System time : 0.002 s
% 0.22/0.49 # Total time : 0.009 s
% 0.22/0.49 # Maximum resident set size: 1904 pages
% 0.22/0.49
% 0.22/0.49 # -------------------------------------------------
% 0.22/0.49 # User time : 0.012 s
% 0.22/0.49 # System time : 0.003 s
% 0.22/0.49 # Total time : 0.015 s
% 0.22/0.49 # Maximum resident set size: 1820 pages
% 0.22/0.49 % E---3.1 exiting
% 0.22/0.50 % E exiting
%------------------------------------------------------------------------------