TSTP Solution File: SWC028+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC028+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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.24s 1.43s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 8 unt; 0 def)
% Number of atoms : 116 ( 53 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 136 ( 50 ~; 52 |; 19 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 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 : 25 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax48,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( rearsegP(X1,X2)
& rearsegP(X2,X1) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax48) ).
fof(ax51,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax51) ).
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(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_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 )
& ( neq(esk3_0,nil)
| nil = esk4_0 )
& ( rearsegP(esk4_0,esk3_0)
| nil = esk4_0 )
& ( neq(esk3_0,nil)
| nil = esk3_0 )
& ( rearsegP(esk4_0,esk3_0)
| nil = esk3_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)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])])])]) ).
cnf(c_0_6,negated_conjecture,
( nil = esk2_0
| nil = esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| ~ rearsegP(X3,X4)
| ~ rearsegP(X4,X3)
| 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)],[ax48])])])])]) ).
cnf(c_0_8,negated_conjecture,
( nil = esk3_0
| rearsegP(esk4_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( nil != esk1_0
| nil != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( nil = esk1_0
| esk2_0 != esk1_0 ),
inference(ef,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X2] :
( ~ ssList(X2)
| rearsegP(X2,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])]) ).
cnf(c_0_14,plain,
( X1 = X2
| ~ rearsegP(X2,X1)
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
( nil = esk1_0
| rearsegP(esk2_0,esk1_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_9]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
esk2_0 != esk1_0,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(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)],[ax15])])])])])]) ).
cnf(c_0_21,negated_conjecture,
( nil = esk4_0
| neq(esk3_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,negated_conjecture,
( nil = esk1_0
| ~ rearsegP(esk1_0,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( nil = esk1_0
| rearsegP(X1,esk2_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_6]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( nil = esk2_0
| neq(esk1_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_10]),c_0_9]) ).
cnf(c_0_26,negated_conjecture,
nil = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17])]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
neq(esk1_0,esk1_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26]),c_0_18]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC028+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 06:32:06 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.43 # Preprocessing time : 0.019 s
% 0.24/1.43
% 0.24/1.43 # Proof found!
% 0.24/1.43 # SZS status Theorem
% 0.24/1.43 # SZS output start CNFRefutation
% See solution above
% 0.24/1.43 # Proof object total steps : 30
% 0.24/1.43 # Proof object clause steps : 21
% 0.24/1.43 # Proof object formula steps : 9
% 0.24/1.43 # Proof object conjectures : 20
% 0.24/1.43 # Proof object clause conjectures : 17
% 0.24/1.43 # Proof object formula conjectures : 3
% 0.24/1.43 # Proof object initial clauses used : 11
% 0.24/1.43 # Proof object initial formulas used : 4
% 0.24/1.43 # Proof object generating inferences : 6
% 0.24/1.43 # Proof object simplifying inferences : 17
% 0.24/1.43 # Training examples: 0 positive, 0 negative
% 0.24/1.43 # Parsed axioms : 96
% 0.24/1.43 # Removed by relevancy pruning/SinE : 70
% 0.24/1.43 # Initial clauses : 51
% 0.24/1.43 # Removed in clause preprocessing : 2
% 0.24/1.43 # Initial clauses in saturation : 49
% 0.24/1.43 # Processed clauses : 64
% 0.24/1.43 # ...of these trivial : 3
% 0.24/1.43 # ...subsumed : 2
% 0.24/1.43 # ...remaining for further processing : 59
% 0.24/1.43 # Other redundant clauses eliminated : 6
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 1
% 0.24/1.43 # Backward-rewritten : 23
% 0.24/1.43 # Generated clauses : 154
% 0.24/1.43 # ...of the previous two non-trivial : 140
% 0.24/1.43 # Contextual simplify-reflections : 0
% 0.24/1.43 # Paramodulations : 142
% 0.24/1.43 # Factorizations : 1
% 0.24/1.43 # Equation resolutions : 11
% 0.24/1.43 # Current number of processed clauses : 33
% 0.24/1.43 # Positive orientable unit clauses : 9
% 0.24/1.43 # Positive unorientable unit clauses: 0
% 0.24/1.43 # Negative unit clauses : 3
% 0.24/1.43 # Non-unit-clauses : 21
% 0.24/1.43 # Current number of unprocessed clauses: 47
% 0.24/1.43 # ...number of literals in the above : 239
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 24
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 145
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 56
% 0.24/1.43 # Non-unit clause-clause subsumptions : 0
% 0.24/1.43 # Unit Clause-clause subsumption calls : 9
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 1
% 0.24/1.43 # BW rewrite match successes : 1
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 6111
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.022 s
% 0.24/1.43 # System time : 0.004 s
% 0.24/1.43 # Total time : 0.026 s
% 0.24/1.43 # Maximum resident set size: 3164 pages
%------------------------------------------------------------------------------