TSTP Solution File: SWC030+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC030+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:15 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 33 ( 11 unt; 0 def)
% Number of atoms : 118 ( 83 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 138 ( 53 ~; 52 |; 18 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(X5,X6) != X4
| app(X6,X5) != X3 ) ) )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
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(c_0_2,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(X5,X6) != X4
| app(X6,X5) != X3 ) ) )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_3,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& ssList(esk6_0)
& app(esk5_0,esk6_0) = esk4_0
& app(esk6_0,esk5_0) = esk3_0
& ( nil = esk1_0
| nil = esk2_0 )
& ( nil != esk2_0
| nil = esk2_0 )
& ( nil = esk1_0
| nil != esk1_0 )
& ( nil != esk2_0
| nil != esk1_0 ) ),
inference(distribute,[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_2])])])])])]) ).
cnf(c_0_4,negated_conjecture,
( nil = esk2_0
| nil = esk1_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]) ).
fof(c_0_7,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_8,negated_conjecture,
( nil != esk1_0
| nil != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( nil = esk4_0
| nil = esk3_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_10,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
app(esk6_0,esk5_0) = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,plain,
( nil = X1
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
app(esk5_0,esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_16,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( nil != esk3_0
| nil != esk4_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_5]),c_0_6]) ).
cnf(c_0_18,negated_conjecture,
( nil = esk4_0
| esk3_0 != esk4_0 ),
inference(ef,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
( nil = esk5_0
| nil != esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_20,negated_conjecture,
( nil = esk6_0
| nil != esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_21,negated_conjecture,
( nil = esk4_0
| nil != esk6_0
| nil != esk5_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13]),c_0_12])]) ).
cnf(c_0_22,negated_conjecture,
esk3_0 != esk4_0,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( nil = esk4_0
| esk5_0 = esk3_0 ),
inference(spm,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_24,negated_conjecture,
( nil = esk4_0
| esk6_0 = esk3_0 ),
inference(spm,[status(thm)],[c_0_20,c_0_9]) ).
cnf(c_0_25,negated_conjecture,
( nil = esk3_0
| nil != esk5_0
| nil != esk6_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_16]),c_0_12]),c_0_13])]) ).
cnf(c_0_26,negated_conjecture,
nil = esk4_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_9]),c_0_22]),c_0_23]),c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( nil = esk6_0
| nil != esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_13]),c_0_12])]) ).
cnf(c_0_28,negated_conjecture,
( nil = esk5_0
| nil != 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_13]),c_0_12])]) ).
cnf(c_0_29,negated_conjecture,
( esk5_0 != esk4_0
| esk6_0 != esk4_0 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26]),c_0_26]),c_0_22]) ).
cnf(c_0_30,negated_conjecture,
esk6_0 = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_26]),c_0_26])]) ).
cnf(c_0_31,negated_conjecture,
esk5_0 = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_26]),c_0_26])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC030+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n023.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 : 600
% 0.13/0.35 % DateTime : Sun Jun 12 01:20:51 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.018 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 33
% 0.25/1.43 # Proof object clause steps : 28
% 0.25/1.43 # Proof object formula steps : 5
% 0.25/1.43 # Proof object conjectures : 28
% 0.25/1.43 # Proof object clause conjectures : 25
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 11
% 0.25/1.43 # Proof object initial formulas used : 2
% 0.25/1.43 # Proof object generating inferences : 11
% 0.25/1.43 # Proof object simplifying inferences : 39
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 96
% 0.25/1.43 # Removed by relevancy pruning/SinE : 79
% 0.25/1.43 # Initial clauses : 37
% 0.25/1.43 # Removed in clause preprocessing : 2
% 0.25/1.43 # Initial clauses in saturation : 35
% 0.25/1.43 # Processed clauses : 71
% 0.25/1.43 # ...of these trivial : 3
% 0.25/1.43 # ...subsumed : 13
% 0.25/1.43 # ...remaining for further processing : 54
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 4
% 0.25/1.43 # Backward-rewritten : 29
% 0.25/1.43 # Generated clauses : 191
% 0.25/1.43 # ...of the previous two non-trivial : 180
% 0.25/1.43 # Contextual simplify-reflections : 3
% 0.25/1.43 # Paramodulations : 185
% 0.25/1.43 # Factorizations : 2
% 0.25/1.43 # Equation resolutions : 4
% 0.25/1.43 # Current number of processed clauses : 21
% 0.25/1.43 # Positive orientable unit clauses : 9
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 2
% 0.25/1.43 # Non-unit-clauses : 10
% 0.25/1.43 # Current number of unprocessed clauses: 27
% 0.25/1.43 # ...number of literals in the above : 131
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 33
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 224
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 160
% 0.25/1.43 # Non-unit clause-clause subsumptions : 6
% 0.25/1.43 # Unit Clause-clause subsumption calls : 31
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 3
% 0.25/1.43 # BW rewrite match successes : 3
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 5258
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.021 s
% 0.25/1.43 # System time : 0.003 s
% 0.25/1.43 # Total time : 0.025 s
% 0.25/1.43 # Maximum resident set size: 3152 pages
%------------------------------------------------------------------------------