TSTP Solution File: COM018+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : COM018+4 : TPTP v8.1.0. Released v4.0.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 : Fri Jul 15 01:14:06 EDT 2022
% Result : Theorem 0.20s 1.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 222 ( 23 equ)
% Maximal formula atoms : 96 ( 13 avg)
% Number of connectives : 295 ( 89 ~; 132 |; 69 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 34 ( 2 sgn 18 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( ( aElement0(X1)
& ( xw = X1
| aReductOfIn0(X1,xw,xR)
| ? [X2] :
( aElement0(X2)
& aReductOfIn0(X2,xw,xR)
& sdtmndtplgtdt0(X2,xR,X1) )
| sdtmndtplgtdt0(xw,xR,X1)
| sdtmndtasgtdt0(xw,xR,X1) )
& ~ ? [X2] : aReductOfIn0(X2,X1,xR) )
| aNormalFormOfIn0(X1,xw,xR) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mTermNF,axiom,
! [X1] :
( ( aRewritingSystem0(X1)
& isTerminating0(X1) )
=> ! [X2] :
( aElement0(X2)
=> ? [X3] : aNormalFormOfIn0(X3,X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mTermNF) ).
fof(m__656_01,hypothesis,
( ! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3)
& aReductOfIn0(X2,X1,xR)
& aReductOfIn0(X3,X1,xR) )
=> ? [X4] :
( aElement0(X4)
& ( X2 = X4
| ( ( aReductOfIn0(X4,X2,xR)
| ? [X5] :
( aElement0(X5)
& aReductOfIn0(X5,X2,xR)
& sdtmndtplgtdt0(X5,xR,X4) ) )
& sdtmndtplgtdt0(X2,xR,X4) ) )
& sdtmndtasgtdt0(X2,xR,X4)
& ( X3 = X4
| ( ( aReductOfIn0(X4,X3,xR)
| ? [X5] :
( aElement0(X5)
& aReductOfIn0(X5,X3,xR)
& sdtmndtplgtdt0(X5,xR,X4) ) )
& sdtmndtplgtdt0(X3,xR,X4) ) )
& sdtmndtasgtdt0(X3,xR,X4) ) )
& isLocallyConfluent0(xR)
& ! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> ( ( aReductOfIn0(X2,X1,xR)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X1,xR)
& sdtmndtplgtdt0(X3,xR,X2) )
| sdtmndtplgtdt0(X1,xR,X2) )
=> iLess0(X2,X1) ) )
& isTerminating0(xR) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__656_01) ).
fof(m__799,hypothesis,
( aElement0(xw)
& ( xu = xw
| ( ( aReductOfIn0(xw,xu,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xu,xR)
& sdtmndtplgtdt0(X1,xR,xw) ) )
& sdtmndtplgtdt0(xu,xR,xw) ) )
& sdtmndtasgtdt0(xu,xR,xw)
& ( xv = xw
| ( ( aReductOfIn0(xw,xv,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xv,xR)
& sdtmndtplgtdt0(X1,xR,xw) ) )
& sdtmndtplgtdt0(xv,xR,xw) ) )
& sdtmndtasgtdt0(xv,xR,xw) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__799) ).
fof(m__656,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__656) ).
fof(c_0_5,negated_conjecture,
~ ? [X1] :
( ( aElement0(X1)
& ( xw = X1
| aReductOfIn0(X1,xw,xR)
| ? [X2] :
( aElement0(X2)
& aReductOfIn0(X2,xw,xR)
& sdtmndtplgtdt0(X2,xR,X1) )
| sdtmndtplgtdt0(xw,xR,X1)
| sdtmndtasgtdt0(xw,xR,X1) )
& ~ ? [X2] : aReductOfIn0(X2,X1,xR) )
| aNormalFormOfIn0(X1,xw,xR) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
! [X3,X4,X3] :
( ( xw != X3
| ~ aElement0(X3)
| aReductOfIn0(esk13_1(X3),X3,xR) )
& ( ~ aReductOfIn0(X3,xw,xR)
| ~ aElement0(X3)
| aReductOfIn0(esk13_1(X3),X3,xR) )
& ( ~ aElement0(X4)
| ~ aReductOfIn0(X4,xw,xR)
| ~ sdtmndtplgtdt0(X4,xR,X3)
| ~ aElement0(X3)
| aReductOfIn0(esk13_1(X3),X3,xR) )
& ( ~ sdtmndtplgtdt0(xw,xR,X3)
| ~ aElement0(X3)
| aReductOfIn0(esk13_1(X3),X3,xR) )
& ( ~ sdtmndtasgtdt0(xw,xR,X3)
| ~ aElement0(X3)
| aReductOfIn0(esk13_1(X3),X3,xR) )
& ~ aNormalFormOfIn0(X3,xw,xR) ),
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)],[c_0_5])])])])])])]) ).
fof(c_0_7,plain,
! [X4,X5] :
( ~ aRewritingSystem0(X4)
| ~ isTerminating0(X4)
| ~ aElement0(X5)
| aNormalFormOfIn0(esk17_2(X4,X5),X5,X4) ),
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)],[mTermNF])])])])])]) ).
fof(c_0_8,hypothesis,
! [X6,X7,X8,X12,X13,X14] :
( ( aElement0(esk1_3(X6,X7,X8))
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aReductOfIn0(X7,X6,xR)
| ~ aReductOfIn0(X8,X6,xR) )
& ( aElement0(esk2_3(X6,X7,X8))
| aReductOfIn0(esk1_3(X6,X7,X8),X7,xR)
| X7 = esk1_3(X6,X7,X8)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aReductOfIn0(X7,X6,xR)
| ~ aReductOfIn0(X8,X6,xR) )
& ( aReductOfIn0(esk2_3(X6,X7,X8),X7,xR)
| aReductOfIn0(esk1_3(X6,X7,X8),X7,xR)
| X7 = esk1_3(X6,X7,X8)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aReductOfIn0(X7,X6,xR)
| ~ aReductOfIn0(X8,X6,xR) )
& ( sdtmndtplgtdt0(esk2_3(X6,X7,X8),xR,esk1_3(X6,X7,X8))
| aReductOfIn0(esk1_3(X6,X7,X8),X7,xR)
| X7 = esk1_3(X6,X7,X8)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aReductOfIn0(X7,X6,xR)
| ~ aReductOfIn0(X8,X6,xR) )
& ( sdtmndtplgtdt0(X7,xR,esk1_3(X6,X7,X8))
| X7 = esk1_3(X6,X7,X8)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aReductOfIn0(X7,X6,xR)
| ~ aReductOfIn0(X8,X6,xR) )
& ( sdtmndtasgtdt0(X7,xR,esk1_3(X6,X7,X8))
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aReductOfIn0(X7,X6,xR)
| ~ aReductOfIn0(X8,X6,xR) )
& ( aElement0(esk3_3(X6,X7,X8))
| aReductOfIn0(esk1_3(X6,X7,X8),X8,xR)
| X8 = esk1_3(X6,X7,X8)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aReductOfIn0(X7,X6,xR)
| ~ aReductOfIn0(X8,X6,xR) )
& ( aReductOfIn0(esk3_3(X6,X7,X8),X8,xR)
| aReductOfIn0(esk1_3(X6,X7,X8),X8,xR)
| X8 = esk1_3(X6,X7,X8)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aReductOfIn0(X7,X6,xR)
| ~ aReductOfIn0(X8,X6,xR) )
& ( sdtmndtplgtdt0(esk3_3(X6,X7,X8),xR,esk1_3(X6,X7,X8))
| aReductOfIn0(esk1_3(X6,X7,X8),X8,xR)
| X8 = esk1_3(X6,X7,X8)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aReductOfIn0(X7,X6,xR)
| ~ aReductOfIn0(X8,X6,xR) )
& ( sdtmndtplgtdt0(X8,xR,esk1_3(X6,X7,X8))
| X8 = esk1_3(X6,X7,X8)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aReductOfIn0(X7,X6,xR)
| ~ aReductOfIn0(X8,X6,xR) )
& ( sdtmndtasgtdt0(X8,xR,esk1_3(X6,X7,X8))
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aReductOfIn0(X7,X6,xR)
| ~ aReductOfIn0(X8,X6,xR) )
& isLocallyConfluent0(xR)
& ( ~ aReductOfIn0(X13,X12,xR)
| iLess0(X13,X12)
| ~ aElement0(X12)
| ~ aElement0(X13) )
& ( ~ aElement0(X14)
| ~ aReductOfIn0(X14,X12,xR)
| ~ sdtmndtplgtdt0(X14,xR,X13)
| iLess0(X13,X12)
| ~ aElement0(X12)
| ~ aElement0(X13) )
& ( ~ sdtmndtplgtdt0(X12,xR,X13)
| iLess0(X13,X12)
| ~ aElement0(X12)
| ~ aElement0(X13) )
& isTerminating0(xR) ),
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)],[m__656_01])])])])])])]) ).
fof(c_0_9,hypothesis,
( aElement0(xw)
& ( aElement0(esk11_0)
| aReductOfIn0(xw,xu,xR)
| xu = xw )
& ( aReductOfIn0(esk11_0,xu,xR)
| aReductOfIn0(xw,xu,xR)
| xu = xw )
& ( sdtmndtplgtdt0(esk11_0,xR,xw)
| aReductOfIn0(xw,xu,xR)
| xu = xw )
& ( sdtmndtplgtdt0(xu,xR,xw)
| xu = xw )
& sdtmndtasgtdt0(xu,xR,xw)
& ( aElement0(esk12_0)
| aReductOfIn0(xw,xv,xR)
| xv = xw )
& ( aReductOfIn0(esk12_0,xv,xR)
| aReductOfIn0(xw,xv,xR)
| xv = xw )
& ( sdtmndtplgtdt0(esk12_0,xR,xw)
| aReductOfIn0(xw,xv,xR)
| xv = xw )
& ( sdtmndtplgtdt0(xv,xR,xw)
| xv = xw )
& sdtmndtasgtdt0(xv,xR,xw) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__799])])])])]) ).
cnf(c_0_10,negated_conjecture,
~ aNormalFormOfIn0(X1,xw,xR),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( aNormalFormOfIn0(esk17_2(X1,X2),X2,X1)
| ~ aElement0(X2)
| ~ isTerminating0(X1)
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
isTerminating0(xR),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__656]) ).
cnf(c_0_14,hypothesis,
aElement0(xw),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[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]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : COM018+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Thu Jun 16 17:40:30 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.20/1.38 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.38 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.38 # Preprocessing time : 0.024 s
% 0.20/1.38
% 0.20/1.38 # Proof found!
% 0.20/1.38 # SZS status Theorem
% 0.20/1.38 # SZS output start CNFRefutation
% See solution above
% 0.20/1.38 # Proof object total steps : 16
% 0.20/1.38 # Proof object clause steps : 6
% 0.20/1.38 # Proof object formula steps : 10
% 0.20/1.38 # Proof object conjectures : 5
% 0.20/1.38 # Proof object clause conjectures : 2
% 0.20/1.38 # Proof object formula conjectures : 3
% 0.20/1.38 # Proof object initial clauses used : 5
% 0.20/1.38 # Proof object initial formulas used : 5
% 0.20/1.38 # Proof object generating inferences : 1
% 0.20/1.38 # Proof object simplifying inferences : 4
% 0.20/1.38 # Training examples: 0 positive, 0 negative
% 0.20/1.38 # Parsed axioms : 23
% 0.20/1.38 # Removed by relevancy pruning/SinE : 1
% 0.20/1.38 # Initial clauses : 368
% 0.20/1.38 # Removed in clause preprocessing : 4
% 0.20/1.38 # Initial clauses in saturation : 364
% 0.20/1.38 # Processed clauses : 42
% 0.20/1.38 # ...of these trivial : 0
% 0.20/1.38 # ...subsumed : 0
% 0.20/1.38 # ...remaining for further processing : 42
% 0.20/1.38 # Other redundant clauses eliminated : 0
% 0.20/1.38 # Clauses deleted for lack of memory : 0
% 0.20/1.38 # Backward-subsumed : 0
% 0.20/1.38 # Backward-rewritten : 0
% 0.20/1.38 # Generated clauses : 20
% 0.20/1.38 # ...of the previous two non-trivial : 12
% 0.20/1.38 # Contextual simplify-reflections : 0
% 0.20/1.38 # Paramodulations : 20
% 0.20/1.38 # Factorizations : 0
% 0.20/1.38 # Equation resolutions : 0
% 0.20/1.38 # Current number of processed clauses : 42
% 0.20/1.38 # Positive orientable unit clauses : 17
% 0.20/1.38 # Positive unorientable unit clauses: 0
% 0.20/1.38 # Negative unit clauses : 1
% 0.20/1.38 # Non-unit-clauses : 24
% 0.20/1.38 # Current number of unprocessed clauses: 334
% 0.20/1.38 # ...number of literals in the above : 2777
% 0.20/1.38 # Current number of archived formulas : 0
% 0.20/1.38 # Current number of archived clauses : 0
% 0.20/1.38 # Clause-clause subsumption calls (NU) : 49
% 0.20/1.38 # Rec. Clause-clause subsumption calls : 22
% 0.20/1.38 # Non-unit clause-clause subsumptions : 0
% 0.20/1.38 # Unit Clause-clause subsumption calls : 7
% 0.20/1.38 # Rewrite failures with RHS unbound : 0
% 0.20/1.38 # BW rewrite match attempts : 3
% 0.20/1.38 # BW rewrite match successes : 0
% 0.20/1.38 # Condensation attempts : 0
% 0.20/1.38 # Condensation successes : 0
% 0.20/1.38 # Termbank termtop insertions : 20352
% 0.20/1.38
% 0.20/1.38 # -------------------------------------------------
% 0.20/1.38 # User time : 0.021 s
% 0.20/1.38 # System time : 0.004 s
% 0.20/1.38 # Total time : 0.025 s
% 0.20/1.38 # Maximum resident set size: 3920 pages
% 0.20/23.38 eprover: CPU time limit exceeded, terminating
% 0.20/23.39 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.39 eprover: No such file or directory
% 0.20/23.40 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.40 eprover: No such file or directory
% 0.20/23.40 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.40 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43 eprover: No such file or directory
%------------------------------------------------------------------------------