TSTP Solution File: SWC094+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC094+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:23:15 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 70 ( 32 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 77 ( 29 ~; 23 |; 15 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 15 !; 6 ?)
% 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)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X1
& app(X5,X7) = X2 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
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)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X1
& app(X5,X7) = X2 ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_5,negated_conjecture,
! [X12,X13,X14] :
( 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(X12)
| ~ ssList(X13)
| ~ ssList(X14)
| app(app(X12,X13),X14) != esk1_0
| app(X12,X14) != esk2_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,
esk4_0 = esk1_0,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != esk1_0
| app(X1,X3) != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
esk2_0 = esk1_0,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
fof(c_0_12,plain,
! [X20] :
( ~ ssList(X20)
| app(nil,X20) = X20 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_13,negated_conjecture,
( app(app(X1,X2),X3) != esk1_0
| app(X1,X3) != esk1_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_17,plain,
! [X34] :
( ~ ssList(X34)
| app(X34,nil) = X34 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_18,negated_conjecture,
( app(app(nil,X1),esk1_0) != esk1_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[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_16])]) ).
cnf(c_0_19,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
app(nil,esk1_0) != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_14]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC094+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 02:40:38 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # new_bool_3 with pid 12673 completed with status 0
% 0.21/0.51 # Result found by new_bool_3
% 0.21/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 12676 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.21/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 96
% 0.21/0.51 # Removed by relevancy pruning/SinE : 79
% 0.21/0.51 # Initial clauses : 31
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 31
% 0.21/0.51 # Processed clauses : 55
% 0.21/0.51 # ...of these trivial : 3
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 52
% 0.21/0.51 # Other redundant clauses eliminated : 4
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 1
% 0.21/0.51 # Generated clauses : 15
% 0.21/0.51 # ...of the previous two non-redundant : 8
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 12
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 4
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 24
% 0.21/0.51 # ...of those cached : 19
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 22
% 0.21/0.51 # Positive orientable unit clauses : 8
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 2
% 0.21/0.51 # Non-unit-clauses : 12
% 0.21/0.51 # Current number of unprocessed clauses: 12
% 0.21/0.51 # ...number of literals in the above : 44
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 29
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 86
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 37
% 0.21/0.51 # Non-unit clause-clause subsumptions : 0
% 0.21/0.51 # Unit Clause-clause subsumption calls : 1
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 1
% 0.21/0.51 # BW rewrite match successes : 1
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 3736
% 0.21/0.51 # Search garbage collected termcells : 1243
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.007 s
% 0.21/0.51 # System time : 0.002 s
% 0.21/0.51 # Total time : 0.010 s
% 0.21/0.51 # Maximum resident set size: 1884 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.010 s
% 0.21/0.51 # System time : 0.005 s
% 0.21/0.51 # Total time : 0.015 s
% 0.21/0.51 # Maximum resident set size: 1824 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------