TSTP Solution File: COM012+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : COM012+1 : 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:02 EDT 2022
% Result : Theorem 0.17s 1.36s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 99 ( 12 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 121 ( 47 ~; 53 |; 15 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 31 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mTCTrans,axiom,
! [X1,X2,X3,X4] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3)
& aElement0(X4) )
=> ( ( sdtmndtplgtdt0(X1,X2,X3)
& sdtmndtplgtdt0(X3,X2,X4) )
=> sdtmndtplgtdt0(X1,X2,X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mTCTrans) ).
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__,conjecture,
( ( sdtmndtasgtdt0(xx,xR,xy)
& sdtmndtasgtdt0(xy,xR,xz) )
=> sdtmndtasgtdt0(xx,xR,xz) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__349,hypothesis,
( aElement0(xx)
& aRewritingSystem0(xR)
& aElement0(xy)
& aElement0(xz) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__349) ).
fof(c_0_4,plain,
! [X5,X6,X7,X8] :
( ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ sdtmndtplgtdt0(X7,X6,X8)
| sdtmndtplgtdt0(X5,X6,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCTrans])]) ).
fof(c_0_5,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])])]) ).
fof(c_0_6,negated_conjecture,
~ ( ( sdtmndtasgtdt0(xx,xR,xy)
& sdtmndtasgtdt0(xy,xR,xz) )
=> sdtmndtasgtdt0(xx,xR,xz) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_7,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ sdtmndtplgtdt0(X4,X2,X3)
| ~ sdtmndtplgtdt0(X1,X2,X4)
| ~ aElement0(X3)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( sdtmndtplgtdt0(X3,X2,X1)
| X3 = X1
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtasgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
( sdtmndtasgtdt0(xx,xR,xy)
& sdtmndtasgtdt0(xy,xR,xz)
& ~ sdtmndtasgtdt0(xx,xR,xz) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( X1 = X2
| sdtmndtplgtdt0(X3,X4,X1)
| ~ sdtmndtasgtdt0(X2,X4,X1)
| ~ sdtmndtplgtdt0(X3,X4,X2)
| ~ aRewritingSystem0(X4)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aElement0(X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
sdtmndtasgtdt0(xy,xR,xz),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_13,hypothesis,
aElement0(xy),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_14,hypothesis,
aElement0(xz),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_15,plain,
( sdtmndtasgtdt0(X3,X2,X1)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(X1,xR,xz)
| ~ sdtmndtplgtdt0(X1,xR,xy)
| ~ aElement0(X1) ),
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])]) ).
cnf(c_0_17,negated_conjecture,
( xz = xy
| sdtmndtasgtdt0(X1,xR,xz)
| ~ sdtmndtplgtdt0(X1,xR,xy)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12]),c_0_14])]) ).
cnf(c_0_18,negated_conjecture,
~ sdtmndtasgtdt0(xx,xR,xz),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
( xz = xy
| xy = X1
| sdtmndtasgtdt0(X1,xR,xz)
| ~ sdtmndtasgtdt0(X1,xR,xy)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_8]),c_0_12]),c_0_13])]) ).
cnf(c_0_20,negated_conjecture,
sdtmndtasgtdt0(xx,xR,xy),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_22,negated_conjecture,
( xx = xy
| xz = xy ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_23,negated_conjecture,
xz = xy,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_22]),c_0_11])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_23]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : COM012+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/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 : Thu Jun 16 19:39:30 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.17/1.36 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.17/1.36 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.17/1.36 # Preprocessing time : 0.008 s
% 0.17/1.36
% 0.17/1.36 # Proof found!
% 0.17/1.36 # SZS status Theorem
% 0.17/1.36 # SZS output start CNFRefutation
% See solution above
% 0.17/1.36 # Proof object total steps : 25
% 0.17/1.36 # Proof object clause steps : 17
% 0.17/1.36 # Proof object formula steps : 8
% 0.17/1.36 # Proof object conjectures : 12
% 0.17/1.36 # Proof object clause conjectures : 9
% 0.17/1.36 # Proof object formula conjectures : 3
% 0.17/1.36 # Proof object initial clauses used : 10
% 0.17/1.36 # Proof object initial formulas used : 4
% 0.17/1.36 # Proof object generating inferences : 6
% 0.17/1.36 # Proof object simplifying inferences : 18
% 0.17/1.36 # Training examples: 0 positive, 0 negative
% 0.17/1.36 # Parsed axioms : 10
% 0.17/1.36 # Removed by relevancy pruning/SinE : 3
% 0.17/1.36 # Initial clauses : 14
% 0.17/1.36 # Removed in clause preprocessing : 3
% 0.17/1.36 # Initial clauses in saturation : 11
% 0.17/1.36 # Processed clauses : 20
% 0.17/1.36 # ...of these trivial : 0
% 0.17/1.36 # ...subsumed : 0
% 0.17/1.36 # ...remaining for further processing : 20
% 0.17/1.36 # Other redundant clauses eliminated : 1
% 0.17/1.36 # Clauses deleted for lack of memory : 0
% 0.17/1.36 # Backward-subsumed : 0
% 0.17/1.36 # Backward-rewritten : 7
% 0.17/1.36 # Generated clauses : 15
% 0.17/1.36 # ...of the previous two non-trivial : 13
% 0.17/1.36 # Contextual simplify-reflections : 0
% 0.17/1.36 # Paramodulations : 14
% 0.17/1.36 # Factorizations : 0
% 0.17/1.36 # Equation resolutions : 1
% 0.17/1.36 # Current number of processed clauses : 12
% 0.17/1.36 # Positive orientable unit clauses : 5
% 0.17/1.36 # Positive unorientable unit clauses: 0
% 0.17/1.36 # Negative unit clauses : 0
% 0.17/1.36 # Non-unit-clauses : 7
% 0.17/1.36 # Current number of unprocessed clauses: 1
% 0.17/1.36 # ...number of literals in the above : 5
% 0.17/1.36 # Current number of archived formulas : 0
% 0.17/1.36 # Current number of archived clauses : 7
% 0.17/1.36 # Clause-clause subsumption calls (NU) : 16
% 0.17/1.36 # Rec. Clause-clause subsumption calls : 7
% 0.17/1.36 # Non-unit clause-clause subsumptions : 0
% 0.17/1.36 # Unit Clause-clause subsumption calls : 0
% 0.17/1.36 # Rewrite failures with RHS unbound : 0
% 0.17/1.36 # BW rewrite match attempts : 2
% 0.17/1.36 # BW rewrite match successes : 1
% 0.17/1.36 # Condensation attempts : 0
% 0.17/1.36 # Condensation successes : 0
% 0.17/1.36 # Termbank termtop insertions : 1027
% 0.17/1.36
% 0.17/1.36 # -------------------------------------------------
% 0.17/1.36 # User time : 0.009 s
% 0.17/1.36 # System time : 0.000 s
% 0.17/1.36 # Total time : 0.009 s
% 0.17/1.36 # Maximum resident set size: 2780 pages
%------------------------------------------------------------------------------