TSTP Solution File: SWC106+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC106+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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:43 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 17 unt; 0 def)
% Number of atoms : 148 ( 33 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 179 ( 69 ~; 65 |; 25 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 25 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X5,nil) != X3
| app(X6,cons(X5,nil)) != X4 ) ) )
| ( neq(X1,nil)
& rearsegP(X2,X1) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X5,nil) != X3
| app(X6,cons(X5,nil)) != X4 ) ) )
| ( neq(X1,nil)
& rearsegP(X2,X1) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_6,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ssItem(esk5_0) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk5_0) )
& ( neq(esk2_0,nil)
| ssList(esk6_0) )
& ( ~ neq(esk4_0,nil)
| ssList(esk6_0) )
& ( neq(esk2_0,nil)
| cons(esk5_0,nil) = esk3_0 )
& ( ~ neq(esk4_0,nil)
| cons(esk5_0,nil) = esk3_0 )
& ( neq(esk2_0,nil)
| app(esk6_0,cons(esk5_0,nil)) = esk4_0 )
& ( ~ neq(esk4_0,nil)
| app(esk6_0,cons(esk5_0,nil)) = esk4_0 )
& ( neq(esk2_0,nil)
| ~ neq(esk1_0,nil)
| ~ rearsegP(esk2_0,esk1_0) )
& ( ~ neq(esk4_0,nil)
| ~ neq(esk1_0,nil)
| ~ rearsegP(esk2_0,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)],[inference(fof_simplification,[status(thm)],[c_0_5])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_7]) ).
cnf(c_0_9,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( ~ rearsegP(esk2_0,esk1_0)
| ~ neq(esk1_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_14,plain,
! [X4,X5,X7] :
( ( ssList(esk9_2(X4,X5))
| ~ rearsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( app(esk9_2(X4,X5),X5) = X4
| ~ rearsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( ~ ssList(X7)
| app(X7,X5) != X4
| rearsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) ) ),
inference(distribute,[status(thm)],[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)],[ax6])])])])])])]) ).
cnf(c_0_15,negated_conjecture,
( app(esk6_0,cons(esk5_0,nil)) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_17,negated_conjecture,
( ssList(esk6_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( ~ rearsegP(esk4_0,esk3_0)
| ~ neq(esk3_0,nil)
| ~ neq(esk4_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_9]),c_0_13]) ).
cnf(c_0_20,plain,
( rearsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X3,X2) != X1
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
app(esk6_0,esk3_0) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_11])]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_11])]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_25,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| nil != cons(X4,X3) ),
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)],[ax21])])])])]) ).
cnf(c_0_26,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,negated_conjecture,
( ~ rearsegP(esk4_0,esk3_0)
| ~ neq(esk3_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_11])]) ).
cnf(c_0_28,negated_conjecture,
( rearsegP(X1,esk3_0)
| esk4_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_24,c_0_9]) ).
fof(c_0_30,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_31,plain,
( nil != cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_33,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_11])]) ).
cnf(c_0_34,negated_conjecture,
~ neq(esk3_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_35,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,negated_conjecture,
nil != esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_16]),c_0_32]),c_0_33])]) ).
cnf(c_0_37,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_34,c_0_35]),c_0_32]),c_0_23])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC106+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 00:38:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.019 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 38
% 0.24/1.41 # Proof object clause steps : 28
% 0.24/1.41 # Proof object formula steps : 10
% 0.24/1.41 # Proof object conjectures : 27
% 0.24/1.41 # Proof object clause conjectures : 24
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 14
% 0.24/1.41 # Proof object initial formulas used : 5
% 0.24/1.41 # Proof object generating inferences : 4
% 0.24/1.41 # Proof object simplifying inferences : 30
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 96
% 0.24/1.41 # Removed by relevancy pruning/SinE : 70
% 0.24/1.41 # Initial clauses : 55
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 55
% 0.24/1.41 # Processed clauses : 105
% 0.24/1.41 # ...of these trivial : 10
% 0.24/1.41 # ...subsumed : 14
% 0.24/1.41 # ...remaining for further processing : 81
% 0.24/1.41 # Other redundant clauses eliminated : 5
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 2
% 0.24/1.41 # Generated clauses : 245
% 0.24/1.41 # ...of the previous two non-trivial : 205
% 0.24/1.41 # Contextual simplify-reflections : 5
% 0.24/1.41 # Paramodulations : 235
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 10
% 0.24/1.41 # Current number of processed clauses : 77
% 0.24/1.41 # Positive orientable unit clauses : 18
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 8
% 0.24/1.41 # Non-unit-clauses : 51
% 0.24/1.41 # Current number of unprocessed clauses: 154
% 0.24/1.41 # ...number of literals in the above : 734
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 2
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 232
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 124
% 0.24/1.41 # Non-unit clause-clause subsumptions : 12
% 0.24/1.41 # Unit Clause-clause subsumption calls : 86
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 2
% 0.24/1.41 # BW rewrite match successes : 2
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 7739
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.030 s
% 0.24/1.41 # System time : 0.001 s
% 0.24/1.41 # Total time : 0.031 s
% 0.24/1.41 # Maximum resident set size: 3172 pages
%------------------------------------------------------------------------------