TSTP Solution File: SWC025+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC025+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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:13 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 40 ( 9 unt; 0 def)
% Number of atoms : 162 ( 56 equ)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 199 ( 77 ~; 82 |; 26 &)
% ( 1 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 19 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ duplicatefreeP(X3)
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X4,X5)
& memberP(X3,X5) )
| ( ~ memberP(X3,X5)
& memberP(X4,X5) ) ) )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ duplicatefreeP(X3)
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X4,X5)
& memberP(X3,X5) )
| ( ~ memberP(X3,X5)
& memberP(X4,X5) ) ) )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,negated_conjecture,
! [X10] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& duplicatefreeP(esk3_0)
& ( memberP(esk4_0,X10)
| ~ memberP(esk3_0,X10)
| ~ ssItem(X10) )
& ( memberP(esk3_0,X10)
| ~ memberP(esk4_0,X10)
| ~ ssItem(X10) )
& ( 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(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_4])])])])])])])]) ).
fof(c_0_6,plain,
! [X2] :
( ~ ssItem(X2)
| ~ memberP(nil,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax38])])]) ).
cnf(c_0_7,negated_conjecture,
( nil = esk2_0
| nil = esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X4,X5,X6] :
( ( ~ memberP(cons(X5,X6),X4)
| X4 = X5
| memberP(X6,X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) )
& ( X4 != X5
| memberP(cons(X5,X6),X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X6,X4)
| memberP(cons(X5,X6),X4)
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) ) ),
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)],[ax37])])])])])]) ).
cnf(c_0_10,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( nil = esk4_0
| nil = esk1_0 ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( memberP(esk4_0,X1)
| ~ ssItem(X1)
| ~ memberP(esk3_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( memberP(cons(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X4] :
( ( ssList(esk5_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( ssItem(esk6_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( cons(esk6_1(X4),esk5_1(X4)) = X4
| nil = X4
| ~ ssList(X4) ) ),
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)],[ax20])])])])])]) ).
cnf(c_0_16,negated_conjecture,
( nil = esk1_0
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( memberP(esk4_0,X1)
| ~ memberP(esk1_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( nil = X1
| cons(esk6_1(X1),esk5_1(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( nil = X1
| ssItem(esk6_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( nil = X1
| ssList(esk5_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( nil = esk1_0
| ~ memberP(esk1_0,X1)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( nil = X1
| memberP(X1,esk6_1(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,negated_conjecture,
( nil = esk1_0
| ~ ssItem(esk6_1(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_26,negated_conjecture,
( nil != esk1_0
| nil != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_27,negated_conjecture,
( memberP(esk3_0,X1)
| ~ ssItem(X1)
| ~ memberP(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_28,negated_conjecture,
nil = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_30,negated_conjecture,
( nil != esk1_0
| nil != esk4_0 ),
inference(rw,[status(thm)],[c_0_26,c_0_8]) ).
cnf(c_0_31,negated_conjecture,
( nil = esk1_0
| esk4_0 != esk1_0 ),
inference(ef,[status(thm)],[c_0_11]) ).
cnf(c_0_32,negated_conjecture,
( memberP(esk1_0,X1)
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_33,plain,
( esk1_0 = X1
| memberP(X1,esk6_1(X1))
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_29,c_0_8]) ).
cnf(c_0_35,negated_conjecture,
esk4_0 != esk1_0,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( ~ memberP(esk1_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_10,c_0_28]) ).
cnf(c_0_37,negated_conjecture,
~ ssItem(esk6_1(esk4_0)),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]),c_0_36]) ).
cnf(c_0_38,plain,
( esk1_0 = X1
| ssItem(esk6_1(X1))
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_34])]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC025+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n009.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 16:53:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.020 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 40
% 0.23/1.41 # Proof object clause steps : 31
% 0.23/1.41 # Proof object formula steps : 9
% 0.23/1.41 # Proof object conjectures : 24
% 0.23/1.41 # Proof object clause conjectures : 21
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 13
% 0.23/1.41 # Proof object initial formulas used : 4
% 0.23/1.41 # Proof object generating inferences : 9
% 0.23/1.41 # Proof object simplifying inferences : 22
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 96
% 0.23/1.41 # Removed by relevancy pruning/SinE : 72
% 0.23/1.41 # Initial clauses : 57
% 0.23/1.41 # Removed in clause preprocessing : 2
% 0.23/1.41 # Initial clauses in saturation : 55
% 0.23/1.41 # Processed clauses : 729
% 0.23/1.41 # ...of these trivial : 12
% 0.23/1.41 # ...subsumed : 441
% 0.23/1.41 # ...remaining for further processing : 276
% 0.23/1.41 # Other redundant clauses eliminated : 33
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 8
% 0.23/1.41 # Backward-rewritten : 157
% 0.23/1.41 # Generated clauses : 4914
% 0.23/1.41 # ...of the previous two non-trivial : 4415
% 0.23/1.41 # Contextual simplify-reflections : 284
% 0.23/1.41 # Paramodulations : 4853
% 0.23/1.41 # Factorizations : 1
% 0.23/1.41 # Equation resolutions : 60
% 0.23/1.41 # Current number of processed clauses : 109
% 0.23/1.41 # Positive orientable unit clauses : 9
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 3
% 0.23/1.41 # Non-unit-clauses : 97
% 0.23/1.41 # Current number of unprocessed clauses: 746
% 0.23/1.41 # ...number of literals in the above : 5736
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 165
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 9996
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 3457
% 0.23/1.41 # Non-unit clause-clause subsumptions : 708
% 0.23/1.41 # Unit Clause-clause subsumption calls : 84
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 2
% 0.23/1.41 # BW rewrite match successes : 2
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 93337
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.180 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.183 s
% 0.23/1.41 # Maximum resident set size: 6612 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------