TSTP Solution File: SWC019+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC019+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:37 EDT 2024
% Result : Theorem 0.22s 0.49s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 84 ( 27 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 97 ( 36 ~; 29 |; 17 &)
% ( 2 <=>; 13 =>; 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 : 24 ( 0 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| X4 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5)
& frontsegP(X1,X5) )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax42,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax42) ).
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_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| X4 != X3
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5)
& frontsegP(X1,X5) )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
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
& esk4_0 = esk3_0
& ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ frontsegP(esk2_0,X11)
| ~ frontsegP(esk1_0,X11) )
& ( nil != esk2_0
| nil != esk1_0 ) ),
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,
esk4_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,negated_conjecture,
esk1_0 = esk3_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,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk2_0,X1)
| ~ frontsegP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
esk2_0 = esk1_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
fof(c_0_11,plain,
! [X26] :
( ~ ssList(X26)
| frontsegP(X26,X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])])]) ).
fof(c_0_12,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_13,negated_conjecture,
( ~ frontsegP(esk1_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_14,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_16,plain,
! [X38,X39] :
( ( ~ neq(X38,X39)
| X38 != X39
| ~ ssList(X39)
| ~ ssList(X38) )
& ( X38 = X39
| neq(X38,X39)
| ~ ssList(X39)
| ~ ssList(X38) ) ),
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_12])])])])]) ).
cnf(c_0_17,negated_conjecture,
( nil != esk2_0
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
~ neq(esk1_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_19,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_21,negated_conjecture,
esk1_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_10])]) ).
cnf(c_0_22,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_18,c_0_19]),c_0_20]),c_0_15])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC019+1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n008.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 03:53:53 EDT 2024
% 0.15/0.35 % 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_1 with pid 12314 completed with status 0
% 0.22/0.49 # Result found by new_bool_1
% 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 # 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 12316 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 # Starting new_bool_1 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 : 69
% 0.22/0.49 # Initial clauses : 49
% 0.22/0.49 # Removed in clause preprocessing : 0
% 0.22/0.49 # Initial clauses in saturation : 49
% 0.22/0.49 # Processed clauses : 86
% 0.22/0.49 # ...of these trivial : 3
% 0.22/0.49 # ...subsumed : 0
% 0.22/0.49 # ...remaining for further processing : 83
% 0.22/0.49 # Other redundant clauses eliminated : 7
% 0.22/0.49 # Clauses deleted for lack of memory : 0
% 0.22/0.49 # Backward-subsumed : 0
% 0.22/0.49 # Backward-rewritten : 1
% 0.22/0.49 # Generated clauses : 14
% 0.22/0.49 # ...of the previous two non-redundant : 9
% 0.22/0.49 # ...aggressively subsumed : 0
% 0.22/0.49 # Contextual simplify-reflections : 1
% 0.22/0.49 # Paramodulations : 8
% 0.22/0.49 # Factorizations : 0
% 0.22/0.49 # NegExts : 0
% 0.22/0.49 # Equation resolutions : 7
% 0.22/0.49 # Disequality decompositions : 0
% 0.22/0.49 # Total rewrite steps : 25
% 0.22/0.49 # ...of those cached : 20
% 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 : 30
% 0.22/0.49 # Positive orientable unit clauses : 9
% 0.22/0.49 # Positive unorientable unit clauses: 0
% 0.22/0.49 # Negative unit clauses : 4
% 0.22/0.49 # Non-unit-clauses : 17
% 0.22/0.49 # Current number of unprocessed clauses: 18
% 0.22/0.49 # ...number of literals in the above : 84
% 0.22/0.49 # Current number of archived formulas : 0
% 0.22/0.49 # Current number of archived clauses : 47
% 0.22/0.49 # Clause-clause subsumption calls (NU) : 446
% 0.22/0.49 # Rec. Clause-clause subsumption calls : 113
% 0.22/0.49 # Non-unit clause-clause subsumptions : 1
% 0.22/0.49 # Unit Clause-clause subsumption calls : 5
% 0.22/0.49 # Rewrite failures with RHS unbound : 0
% 0.22/0.49 # BW rewrite match attempts : 1
% 0.22/0.49 # BW rewrite match successes : 1
% 0.22/0.49 # Condensation attempts : 0
% 0.22/0.49 # Condensation successes : 0
% 0.22/0.49 # Termbank termtop insertions : 5303
% 0.22/0.49 # Search garbage collected termcells : 1566
% 0.22/0.49
% 0.22/0.49 # -------------------------------------------------
% 0.22/0.49 # User time : 0.010 s
% 0.22/0.49 # System time : 0.002 s
% 0.22/0.49 # Total time : 0.011 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.013 s
% 0.22/0.49 # System time : 0.004 s
% 0.22/0.49 # Total time : 0.017 s
% 0.22/0.49 # Maximum resident set size: 1820 pages
% 0.22/0.49 % E---3.1 exiting
% 0.22/0.49 % E exiting
%------------------------------------------------------------------------------