TSTP Solution File: COM023+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : COM023+1 : TPTP v8.1.0. Released v4.0.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 : Fri Jul 15 01:14:08 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 146 ( 0 equ)
% Maximal formula atoms : 44 ( 5 avg)
% Number of connectives : 213 ( 93 ~; 94 |; 22 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-4 aty)
% Number of variables : 36 ( 0 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
isConfluent0(xR),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mCRDef,axiom,
! [X1] :
( aRewritingSystem0(X1)
=> ( isConfluent0(X1)
<=> ! [X2,X3,X4] :
( ( aElement0(X2)
& aElement0(X3)
& aElement0(X4)
& sdtmndtasgtdt0(X2,X1,X3)
& sdtmndtasgtdt0(X2,X1,X4) )
=> ? [X5] :
( aElement0(X5)
& sdtmndtasgtdt0(X3,X1,X5)
& sdtmndtasgtdt0(X4,X1,X5) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mCRDef) ).
fof(m__715,hypothesis,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3)
& sdtmndtasgtdt0(X1,xR,X2)
& sdtmndtasgtdt0(X1,xR,X3) )
=> ? [X4] :
( aElement0(X4)
& sdtmndtasgtdt0(X2,xR,X4)
& sdtmndtasgtdt0(X3,xR,X4) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__715) ).
fof(m__656,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__656) ).
fof(c_0_4,negated_conjecture,
~ isConfluent0(xR),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,plain,
! [X6,X7,X8,X9,X14] :
( ( aElement0(esk6_4(X6,X7,X8,X9))
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aElement0(X9)
| ~ sdtmndtasgtdt0(X7,X6,X8)
| ~ sdtmndtasgtdt0(X7,X6,X9)
| ~ isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( sdtmndtasgtdt0(X8,X6,esk6_4(X6,X7,X8,X9))
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aElement0(X9)
| ~ sdtmndtasgtdt0(X7,X6,X8)
| ~ sdtmndtasgtdt0(X7,X6,X9)
| ~ isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( sdtmndtasgtdt0(X9,X6,esk6_4(X6,X7,X8,X9))
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aElement0(X9)
| ~ sdtmndtasgtdt0(X7,X6,X8)
| ~ sdtmndtasgtdt0(X7,X6,X9)
| ~ isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( aElement0(esk7_1(X6))
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( aElement0(esk8_1(X6))
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( aElement0(esk9_1(X6))
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( sdtmndtasgtdt0(esk7_1(X6),X6,esk8_1(X6))
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( sdtmndtasgtdt0(esk7_1(X6),X6,esk9_1(X6))
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( ~ aElement0(X14)
| ~ sdtmndtasgtdt0(esk8_1(X6),X6,X14)
| ~ sdtmndtasgtdt0(esk9_1(X6),X6,X14)
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) ) ),
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)],[mCRDef])])])])])])]) ).
fof(c_0_6,hypothesis,
! [X5,X6,X7] :
( ( aElement0(esk1_3(X5,X6,X7))
| ~ aElement0(X5)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ sdtmndtasgtdt0(X5,xR,X6)
| ~ sdtmndtasgtdt0(X5,xR,X7) )
& ( sdtmndtasgtdt0(X6,xR,esk1_3(X5,X6,X7))
| ~ aElement0(X5)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ sdtmndtasgtdt0(X5,xR,X6)
| ~ sdtmndtasgtdt0(X5,xR,X7) )
& ( sdtmndtasgtdt0(X7,xR,esk1_3(X5,X6,X7))
| ~ aElement0(X5)
| ~ aElement0(X6)
| ~ aElement0(X7)
| ~ sdtmndtasgtdt0(X5,xR,X6)
| ~ sdtmndtasgtdt0(X5,xR,X7) ) ),
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)],[m__715])])])])])]) ).
fof(c_0_7,negated_conjecture,
~ isConfluent0(xR),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( isConfluent0(X1)
| ~ aRewritingSystem0(X1)
| ~ sdtmndtasgtdt0(esk9_1(X1),X1,X2)
| ~ sdtmndtasgtdt0(esk8_1(X1),X1,X2)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
( sdtmndtasgtdt0(X3,xR,esk1_3(X1,X3,X2))
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ sdtmndtasgtdt0(X1,xR,X3)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__656]) ).
cnf(c_0_11,negated_conjecture,
~ isConfluent0(xR),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
( aElement0(esk1_3(X1,X3,X2))
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ sdtmndtasgtdt0(X1,xR,X3)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,hypothesis,
( ~ sdtmndtasgtdt0(esk8_1(xR),xR,esk1_3(X1,esk9_1(xR),X2))
| ~ sdtmndtasgtdt0(X1,xR,esk9_1(xR))
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ aElement0(esk9_1(xR))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_11]),c_0_12]) ).
cnf(c_0_14,hypothesis,
( sdtmndtasgtdt0(X2,xR,esk1_3(X1,X3,X2))
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ sdtmndtasgtdt0(X1,xR,X3)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,hypothesis,
( ~ sdtmndtasgtdt0(X1,xR,esk9_1(xR))
| ~ sdtmndtasgtdt0(X1,xR,esk8_1(xR))
| ~ aElement0(esk9_1(xR))
| ~ aElement0(esk8_1(xR))
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( isConfluent0(X1)
| sdtmndtasgtdt0(esk7_1(X1),X1,esk9_1(X1))
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,hypothesis,
( ~ sdtmndtasgtdt0(esk7_1(xR),xR,esk8_1(xR))
| ~ aElement0(esk9_1(xR))
| ~ aElement0(esk8_1(xR))
| ~ aElement0(esk7_1(xR)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_10])]),c_0_11]) ).
cnf(c_0_18,plain,
( isConfluent0(X1)
| aElement0(esk9_1(X1))
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,hypothesis,
( ~ sdtmndtasgtdt0(esk7_1(xR),xR,esk8_1(xR))
| ~ aElement0(esk8_1(xR))
| ~ aElement0(esk7_1(xR)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_10])]),c_0_11]) ).
cnf(c_0_20,plain,
( isConfluent0(X1)
| sdtmndtasgtdt0(esk7_1(X1),X1,esk8_1(X1))
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,hypothesis,
( ~ aElement0(esk8_1(xR))
| ~ aElement0(esk7_1(xR)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_10])]),c_0_11]) ).
cnf(c_0_22,plain,
( isConfluent0(X1)
| aElement0(esk8_1(X1))
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,hypothesis,
~ aElement0(esk7_1(xR)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_10])]),c_0_11]) ).
cnf(c_0_24,plain,
( isConfluent0(X1)
| aElement0(esk7_1(X1))
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_10])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM023+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 18:43:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.017 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 26
% 0.23/1.42 # Proof object clause steps : 18
% 0.23/1.42 # Proof object formula steps : 8
% 0.23/1.42 # Proof object conjectures : 4
% 0.23/1.42 # Proof object clause conjectures : 1
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 11
% 0.23/1.42 # Proof object initial formulas used : 4
% 0.23/1.42 # Proof object generating inferences : 7
% 0.23/1.42 # Proof object simplifying inferences : 19
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 18
% 0.23/1.42 # Removed by relevancy pruning/SinE : 4
% 0.23/1.42 # Initial clauses : 39
% 0.23/1.42 # Removed in clause preprocessing : 3
% 0.23/1.42 # Initial clauses in saturation : 36
% 0.23/1.42 # Processed clauses : 54
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 3
% 0.23/1.42 # ...remaining for further processing : 51
% 0.23/1.42 # Other redundant clauses eliminated : 1
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 2
% 0.23/1.42 # Backward-rewritten : 0
% 0.23/1.42 # Generated clauses : 52
% 0.23/1.42 # ...of the previous two non-trivial : 43
% 0.23/1.42 # Contextual simplify-reflections : 18
% 0.23/1.42 # Paramodulations : 51
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 1
% 0.23/1.42 # Current number of processed clauses : 48
% 0.23/1.42 # Positive orientable unit clauses : 3
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 2
% 0.23/1.42 # Non-unit-clauses : 43
% 0.23/1.42 # Current number of unprocessed clauses: 25
% 0.23/1.42 # ...number of literals in the above : 202
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 2
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 158
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 63
% 0.23/1.42 # Non-unit clause-clause subsumptions : 23
% 0.23/1.42 # Unit Clause-clause subsumption calls : 7
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 0
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 4495
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.019 s
% 0.23/1.42 # System time : 0.002 s
% 0.23/1.42 # Total time : 0.021 s
% 0.23/1.42 # Maximum resident set size: 3040 pages
%------------------------------------------------------------------------------