TSTP Solution File: SWC204+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC204+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:27:19 EDT 2022
% Result : Theorem 0.19s 1.36s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 51 ( 13 unt; 0 def)
% Number of atoms : 189 ( 68 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 230 ( 92 ~; 94 |; 24 &)
% ( 1 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X4 != X5
& ? [X6] :
( ssList(X6)
& tl(X4) = X6
& app(X3,X6) = X5
& neq(nil,X4) ) )
| neq(X1,nil) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
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(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X4 != X5
& ? [X6] :
( ssList(X6)
& tl(X4) = X6
& app(X3,X6) = X5
& neq(nil,X4) ) )
| neq(X1,nil) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_9,negated_conjecture,
! [X11,X12] :
( 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)
| ~ ssList(X11)
| esk4_0 = X11
| ~ ssList(X12)
| tl(esk4_0) != X12
| app(esk3_0,X12) != X11
| ~ neq(nil,esk4_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X11)
| esk4_0 = X11
| ~ ssList(X12)
| tl(esk4_0) != X12
| app(esk3_0,X12) != X11
| ~ neq(nil,esk4_0) )
& ( neq(esk2_0,nil)
| ~ neq(esk1_0,nil) )
& ( ~ neq(esk4_0,nil)
| ~ neq(esk1_0,nil) ) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_8])])])])])])])]) ).
cnf(c_0_10,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_11,negated_conjecture,
( ~ neq(esk1_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( esk4_0 = X2
| ~ neq(nil,esk4_0)
| app(esk3_0,X1) != X2
| tl(esk4_0) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ~ neq(esk1_0,nil)
| ~ neq(esk2_0,nil) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_17,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_18,negated_conjecture,
( esk2_0 = X1
| app(esk1_0,X2) != X1
| tl(esk2_0) != X2
| ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_12]),c_0_12]),c_0_14]),c_0_12]),c_0_12]),c_0_15])]) ).
cnf(c_0_19,negated_conjecture,
~ neq(esk1_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15])]) ).
cnf(c_0_20,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_23,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_24,negated_conjecture,
( app(esk1_0,X1) = esk2_0
| tl(esk2_0) != X1
| ~ ssList(app(esk1_0,X1))
| ~ ssList(X1)
| ~ neq(nil,esk2_0) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
nil = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_26,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( app(esk1_0,X1) = esk2_0
| tl(esk2_0) != X1
| ~ ssList(app(esk1_0,X1))
| ~ ssList(X1)
| ~ neq(esk1_0,esk2_0) ),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( app(esk1_0,X1) = X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_26,c_0_25]) ).
fof(c_0_29,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssList(tl(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
fof(c_0_30,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| cons(hd(X2),tl(X2)) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
cnf(c_0_31,negated_conjecture,
( X1 = esk2_0
| tl(esk2_0) != X1
| ~ ssList(X1)
| ~ neq(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( tl(esk2_0) = esk2_0
| ~ ssList(tl(esk2_0))
| ~ neq(esk1_0,esk2_0) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_35,plain,
( esk1_0 = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_32,c_0_25]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_37,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,X3) != 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)],[ax18])])])])]) ).
cnf(c_0_38,plain,
( cons(hd(X1),tl(X1)) = X1
| esk1_0 = X1
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_33,c_0_25]) ).
cnf(c_0_39,negated_conjecture,
( tl(esk2_0) = esk2_0
| esk2_0 = esk1_0
| ~ neq(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
fof(c_0_40,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_41,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( cons(hd(esk2_0),esk2_0) = esk2_0
| esk2_0 = esk1_0
| ~ neq(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_36])]) ).
cnf(c_0_43,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( esk2_0 = esk1_0
| ~ neq(esk1_0,esk2_0)
| ~ ssItem(hd(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_36])]) ).
cnf(c_0_45,plain,
( esk1_0 = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_43,c_0_25]) ).
cnf(c_0_46,negated_conjecture,
( esk2_0 = esk1_0
| ~ neq(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_36])]) ).
cnf(c_0_47,negated_conjecture,
neq(esk2_0,esk1_0),
inference(rw,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_48,negated_conjecture,
esk2_0 = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_20]),c_0_36]),c_0_22])]) ).
cnf(c_0_49,negated_conjecture,
~ neq(esk1_0,esk1_0),
inference(rw,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWC204+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.11 % Command : run_ET %s %d
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Sun Jun 12 17:40:26 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.19/1.36 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.19/1.36 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.19/1.36 # Preprocessing time : 0.015 s
% 0.19/1.36
% 0.19/1.36 # Proof found!
% 0.19/1.36 # SZS status Theorem
% 0.19/1.36 # SZS output start CNFRefutation
% See solution above
% 0.19/1.36 # Proof object total steps : 51
% 0.19/1.36 # Proof object clause steps : 35
% 0.19/1.36 # Proof object formula steps : 16
% 0.19/1.36 # Proof object conjectures : 27
% 0.19/1.36 # Proof object clause conjectures : 24
% 0.19/1.36 # Proof object formula conjectures : 3
% 0.19/1.36 # Proof object initial clauses used : 14
% 0.19/1.36 # Proof object initial formulas used : 8
% 0.19/1.36 # Proof object generating inferences : 9
% 0.19/1.36 # Proof object simplifying inferences : 34
% 0.19/1.36 # Training examples: 0 positive, 0 negative
% 0.19/1.36 # Parsed axioms : 96
% 0.19/1.36 # Removed by relevancy pruning/SinE : 67
% 0.19/1.36 # Initial clauses : 51
% 0.19/1.36 # Removed in clause preprocessing : 0
% 0.19/1.36 # Initial clauses in saturation : 51
% 0.19/1.36 # Processed clauses : 414
% 0.19/1.36 # ...of these trivial : 21
% 0.19/1.36 # ...subsumed : 194
% 0.19/1.36 # ...remaining for further processing : 199
% 0.19/1.36 # Other redundant clauses eliminated : 3
% 0.19/1.36 # Clauses deleted for lack of memory : 0
% 0.19/1.36 # Backward-subsumed : 17
% 0.19/1.36 # Backward-rewritten : 88
% 0.19/1.36 # Generated clauses : 2586
% 0.19/1.36 # ...of the previous two non-trivial : 2260
% 0.19/1.36 # Contextual simplify-reflections : 136
% 0.19/1.36 # Paramodulations : 2559
% 0.19/1.36 # Factorizations : 0
% 0.19/1.36 # Equation resolutions : 27
% 0.19/1.36 # Current number of processed clauses : 92
% 0.19/1.36 # Positive orientable unit clauses : 7
% 0.19/1.36 # Positive unorientable unit clauses: 0
% 0.19/1.36 # Negative unit clauses : 2
% 0.19/1.36 # Non-unit-clauses : 83
% 0.19/1.36 # Current number of unprocessed clauses: 891
% 0.19/1.36 # ...number of literals in the above : 5553
% 0.19/1.36 # Current number of archived formulas : 0
% 0.19/1.36 # Current number of archived clauses : 105
% 0.19/1.36 # Clause-clause subsumption calls (NU) : 4778
% 0.19/1.36 # Rec. Clause-clause subsumption calls : 1732
% 0.19/1.36 # Non-unit clause-clause subsumptions : 347
% 0.19/1.36 # Unit Clause-clause subsumption calls : 5
% 0.19/1.36 # Rewrite failures with RHS unbound : 0
% 0.19/1.36 # BW rewrite match attempts : 3
% 0.19/1.36 # BW rewrite match successes : 3
% 0.19/1.36 # Condensation attempts : 0
% 0.19/1.36 # Condensation successes : 0
% 0.19/1.36 # Termbank termtop insertions : 48746
% 0.19/1.36
% 0.19/1.36 # -------------------------------------------------
% 0.19/1.36 # User time : 0.094 s
% 0.19/1.36 # System time : 0.003 s
% 0.19/1.36 # Total time : 0.097 s
% 0.19/1.36 # Maximum resident set size: 4756 pages
% 0.21/23.36 eprover: CPU time limit exceeded, terminating
% 0.21/23.38 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.38 eprover: No such file or directory
% 0.21/23.38 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.38 eprover: No such file or directory
% 0.21/23.39 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.39 eprover: No such file or directory
% 0.21/23.39 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.39 eprover: No such file or directory
% 0.21/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.40 eprover: No such file or directory
% 0.21/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.40 eprover: No such file or directory
% 0.21/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.41 eprover: No such file or directory
% 0.21/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.41 eprover: No such file or directory
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.43 eprover: No such file or directory
%------------------------------------------------------------------------------