TSTP Solution File: COM016+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : COM016+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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:04 EDT 2022
% Result : Theorem 0.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 129 ( 4 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 175 ( 73 ~; 79 |; 19 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 39 ( 0 sgn 14 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xa,xR)
& sdtmndtasgtdt0(X1,xR,xb) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mTCDef,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3) )
=> ( sdtmndtplgtdt0(X1,X2,X3)
<=> ( aReductOfIn0(X3,X1,X2)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,X2)
& sdtmndtplgtdt0(X4,X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mTCDef) ).
fof(mTCRDef,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3) )
=> ( sdtmndtasgtdt0(X1,X2,X3)
<=> ( X1 = X3
| sdtmndtplgtdt0(X1,X2,X3) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mTCRDef) ).
fof(m__656,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__656) ).
fof(m__731,hypothesis,
( aElement0(xa)
& aElement0(xb)
& aElement0(xc) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__731) ).
fof(m__731_02,hypothesis,
( sdtmndtplgtdt0(xa,xR,xb)
& sdtmndtplgtdt0(xa,xR,xc) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__731_02) ).
fof(c_0_6,negated_conjecture,
~ ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xa,xR)
& sdtmndtasgtdt0(X1,xR,xb) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,negated_conjecture,
! [X2] :
( ~ aElement0(X2)
| ~ aReductOfIn0(X2,xa,xR)
| ~ sdtmndtasgtdt0(X2,xR,xb) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_8,plain,
! [X5,X6,X7,X9] :
( ( aElement0(esk8_3(X5,X6,X7))
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( aReductOfIn0(esk8_3(X5,X6,X7),X5,X6)
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( sdtmndtplgtdt0(esk8_3(X5,X6,X7),X6,X7)
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( ~ aReductOfIn0(X7,X5,X6)
| sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( ~ aElement0(X9)
| ~ aReductOfIn0(X9,X5,X6)
| ~ sdtmndtplgtdt0(X9,X6,X7)
| sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) ) ),
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)],[mTCDef])])])])])])]) ).
fof(c_0_9,plain,
! [X4,X5,X6] :
( ( ~ sdtmndtasgtdt0(X4,X5,X6)
| X4 = X6
| sdtmndtplgtdt0(X4,X5,X6)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aElement0(X6) )
& ( X4 != X6
| sdtmndtasgtdt0(X4,X5,X6)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aElement0(X6) )
& ( ~ sdtmndtplgtdt0(X4,X5,X6)
| sdtmndtasgtdt0(X4,X5,X6)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X5)
| ~ aElement0(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCRDef])])]) ).
cnf(c_0_10,negated_conjecture,
( ~ sdtmndtasgtdt0(X1,xR,xb)
| ~ aReductOfIn0(X1,xa,xR)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( aReductOfIn0(X1,X3,X2)
| aReductOfIn0(esk8_3(X3,X2,X1),X3,X2)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__656]) ).
cnf(c_0_13,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_14,plain,
( sdtmndtasgtdt0(X3,X2,X1)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( aReductOfIn0(X1,X3,X2)
| sdtmndtplgtdt0(esk8_3(X3,X2,X1),X2,X1)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( aReductOfIn0(X1,X3,X2)
| aElement0(esk8_3(X3,X2,X1))
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( aReductOfIn0(X1,xa,xR)
| ~ sdtmndtasgtdt0(esk8_3(xa,xR,X1),xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,X1)
| ~ aElement0(esk8_3(xa,xR,X1))
| ~ aElement0(X1) ),
inference(cn,[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])]) ).
cnf(c_0_18,plain,
( sdtmndtasgtdt0(esk8_3(X1,X2,X3),X2,X3)
| aReductOfIn0(X3,X1,X2)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,hypothesis,
sdtmndtplgtdt0(xa,xR,xb),
inference(split_conjunct,[status(thm)],[m__731_02]) ).
cnf(c_0_20,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_21,negated_conjecture,
( aReductOfIn0(xb,xa,xR)
| ~ aElement0(esk8_3(xa,xR,xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),c_0_12]),c_0_13])]) ).
cnf(c_0_22,negated_conjecture,
aReductOfIn0(xb,xa,xR),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_16]),c_0_19]),c_0_12]),c_0_13]),c_0_20])]) ).
cnf(c_0_23,plain,
( sdtmndtasgtdt0(X3,X2,X1)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| X3 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_22]),c_0_20])]) ).
cnf(c_0_25,plain,
( sdtmndtasgtdt0(X1,X2,X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_12]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : COM016+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 19:11:00 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.44 # Preprocessing time : 0.019 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 27
% 0.26/1.44 # Proof object clause steps : 17
% 0.26/1.44 # Proof object formula steps : 10
% 0.26/1.44 # Proof object conjectures : 9
% 0.26/1.44 # Proof object clause conjectures : 6
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 10
% 0.26/1.44 # Proof object initial formulas used : 6
% 0.26/1.44 # Proof object generating inferences : 6
% 0.26/1.44 # Proof object simplifying inferences : 20
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 20
% 0.26/1.44 # Removed by relevancy pruning/SinE : 3
% 0.26/1.44 # Initial clauses : 41
% 0.26/1.44 # Removed in clause preprocessing : 4
% 0.26/1.44 # Initial clauses in saturation : 37
% 0.26/1.44 # Processed clauses : 111
% 0.26/1.44 # ...of these trivial : 0
% 0.26/1.44 # ...subsumed : 20
% 0.26/1.44 # ...remaining for further processing : 91
% 0.26/1.44 # Other redundant clauses eliminated : 1
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 1
% 0.26/1.44 # Backward-rewritten : 1
% 0.26/1.44 # Generated clauses : 194
% 0.26/1.44 # ...of the previous two non-trivial : 146
% 0.26/1.44 # Contextual simplify-reflections : 59
% 0.26/1.44 # Paramodulations : 193
% 0.26/1.44 # Factorizations : 0
% 0.26/1.44 # Equation resolutions : 1
% 0.26/1.44 # Current number of processed clauses : 88
% 0.26/1.44 # Positive orientable unit clauses : 13
% 0.26/1.44 # Positive unorientable unit clauses: 0
% 0.26/1.44 # Negative unit clauses : 2
% 0.26/1.44 # Non-unit-clauses : 73
% 0.26/1.44 # Current number of unprocessed clauses: 72
% 0.26/1.44 # ...number of literals in the above : 596
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 2
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 1211
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 254
% 0.26/1.44 # Non-unit clause-clause subsumptions : 80
% 0.26/1.44 # Unit Clause-clause subsumption calls : 95
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 3
% 0.26/1.44 # BW rewrite match successes : 1
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 8315
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.024 s
% 0.26/1.44 # System time : 0.006 s
% 0.26/1.44 # Total time : 0.030 s
% 0.26/1.44 # Maximum resident set size: 3300 pages
%------------------------------------------------------------------------------