TSTP Solution File: SWC007+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC007+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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 : 600s
% DateTime : Tue Jul 19 20:26:06 EDT 2022
% Result : Theorem 0.27s 1.44s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 9 unt; 0 def)
% Number of atoms : 118 ( 51 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 146 ( 60 ~; 53 |; 18 &)
% ( 1 <=>; 14 =>; 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 : 50 ( 0 sgn 23 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X3
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X3
| X2 != X4
| X1 != X3
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1 ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_7,negated_conjecture,
! [X12,X13,X14] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& nil = esk3_0
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( ~ ssList(X12)
| ~ ssList(X13)
| ~ ssList(X14)
| app(app(X12,X13),X14) != esk2_0
| app(X12,X14) != esk1_0 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])]) ).
fof(c_0_8,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_9,negated_conjecture,
( app(X1,X2) != esk1_0
| app(app(X1,X3),X2) != esk2_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
nil = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_15,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| ssList(app(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])])]) ).
fof(c_0_16,plain,
! [X3,X4] :
( ( nil = X4
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil = X3
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])])]) ).
cnf(c_0_17,negated_conjecture,
( app(app(X1,X2),X3) != esk4_0
| app(X1,X3) != esk3_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_18,plain,
( app(X1,esk3_0) = X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_20,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_23,negated_conjecture,
( app(X1,esk3_0) != esk3_0
| app(X1,X2) != esk4_0
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_24,plain,
( app(X1,X2) = esk3_0
| esk3_0 != X2
| esk3_0 != X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_25,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( app(X1,X2) != esk4_0
| esk3_0 != X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_19])]) ).
cnf(c_0_27,plain,
( app(esk3_0,X1) = X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_29,negated_conjecture,
( X1 != esk4_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_19])]) ).
cnf(c_0_30,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_28,c_0_11]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_29,c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC007+1 : TPTP v8.1.0. Released v2.4.0.
% 0.15/0.14 % Command : run_ET %s %d
% 0.15/0.35 % Computer : n017.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.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jun 11 22:29:51 EDT 2022
% 0.22/0.36 % CPUTime :
% 0.27/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.27/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.27/1.44 # Preprocessing time : 0.019 s
% 0.27/1.44
% 0.27/1.44 # Proof found!
% 0.27/1.44 # SZS status Theorem
% 0.27/1.44 # SZS output start CNFRefutation
% See solution above
% 0.27/1.44 # Proof object total steps : 32
% 0.27/1.44 # Proof object clause steps : 20
% 0.27/1.44 # Proof object formula steps : 12
% 0.27/1.44 # Proof object conjectures : 14
% 0.27/1.44 # Proof object clause conjectures : 11
% 0.27/1.44 # Proof object formula conjectures : 3
% 0.27/1.44 # Proof object initial clauses used : 10
% 0.27/1.44 # Proof object initial formulas used : 6
% 0.27/1.44 # Proof object generating inferences : 4
% 0.27/1.44 # Proof object simplifying inferences : 16
% 0.27/1.44 # Training examples: 0 positive, 0 negative
% 0.27/1.44 # Parsed axioms : 96
% 0.27/1.44 # Removed by relevancy pruning/SinE : 79
% 0.27/1.44 # Initial clauses : 31
% 0.27/1.44 # Removed in clause preprocessing : 0
% 0.27/1.44 # Initial clauses in saturation : 31
% 0.27/1.44 # Processed clauses : 61
% 0.27/1.44 # ...of these trivial : 3
% 0.27/1.44 # ...subsumed : 14
% 0.27/1.44 # ...remaining for further processing : 44
% 0.27/1.44 # Other redundant clauses eliminated : 0
% 0.27/1.44 # Clauses deleted for lack of memory : 0
% 0.27/1.44 # Backward-subsumed : 2
% 0.27/1.44 # Backward-rewritten : 1
% 0.27/1.44 # Generated clauses : 194
% 0.27/1.44 # ...of the previous two non-trivial : 152
% 0.27/1.44 # Contextual simplify-reflections : 5
% 0.27/1.44 # Paramodulations : 189
% 0.27/1.44 # Factorizations : 0
% 0.27/1.44 # Equation resolutions : 5
% 0.27/1.44 # Current number of processed clauses : 41
% 0.27/1.44 # Positive orientable unit clauses : 8
% 0.27/1.44 # Positive unorientable unit clauses: 0
% 0.27/1.44 # Negative unit clauses : 2
% 0.27/1.44 # Non-unit-clauses : 31
% 0.27/1.44 # Current number of unprocessed clauses: 112
% 0.27/1.44 # ...number of literals in the above : 580
% 0.27/1.44 # Current number of archived formulas : 0
% 0.27/1.44 # Current number of archived clauses : 3
% 0.27/1.44 # Clause-clause subsumption calls (NU) : 361
% 0.27/1.44 # Rec. Clause-clause subsumption calls : 166
% 0.27/1.44 # Non-unit clause-clause subsumptions : 16
% 0.27/1.44 # Unit Clause-clause subsumption calls : 24
% 0.27/1.44 # Rewrite failures with RHS unbound : 0
% 0.27/1.44 # BW rewrite match attempts : 1
% 0.27/1.44 # BW rewrite match successes : 1
% 0.27/1.44 # Condensation attempts : 0
% 0.27/1.44 # Condensation successes : 0
% 0.27/1.44 # Termbank termtop insertions : 5767
% 0.27/1.44
% 0.27/1.44 # -------------------------------------------------
% 0.27/1.44 # User time : 0.023 s
% 0.27/1.44 # System time : 0.003 s
% 0.27/1.44 # Total time : 0.026 s
% 0.27/1.44 # Maximum resident set size: 3152 pages
%------------------------------------------------------------------------------