TSTP Solution File: COM012+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : COM012+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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:03 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 118 ( 22 equ)
% Maximal formula atoms : 31 ( 5 avg)
% Number of connectives : 122 ( 25 ~; 50 |; 43 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn 9 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ( xx = xy
| ( ( aReductOfIn0(xy,xx,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xx,xR)
& sdtmndtplgtdt0(X1,xR,xy) ) )
& sdtmndtplgtdt0(xx,xR,xy) ) )
& sdtmndtasgtdt0(xx,xR,xy)
& ( xy = xz
| ( ( aReductOfIn0(xz,xy,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xy,xR)
& sdtmndtplgtdt0(X1,xR,xz) ) )
& sdtmndtplgtdt0(xy,xR,xz) ) )
& sdtmndtasgtdt0(xy,xR,xz) )
=> ( xx = xz
| aReductOfIn0(xz,xx,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xx,xR)
& sdtmndtplgtdt0(X1,xR,xz) )
| sdtmndtplgtdt0(xx,xR,xz)
| sdtmndtasgtdt0(xx,xR,xz) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
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(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_3,negated_conjecture,
~ ( ( ( xx = xy
| ( ( aReductOfIn0(xy,xx,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xx,xR)
& sdtmndtplgtdt0(X1,xR,xy) ) )
& sdtmndtplgtdt0(xx,xR,xy) ) )
& sdtmndtasgtdt0(xx,xR,xy)
& ( xy = xz
| ( ( aReductOfIn0(xz,xy,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xy,xR)
& sdtmndtplgtdt0(X1,xR,xz) ) )
& sdtmndtplgtdt0(xy,xR,xz) ) )
& sdtmndtasgtdt0(xy,xR,xz) )
=> ( xx = xz
| aReductOfIn0(xz,xx,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xx,xR)
& sdtmndtplgtdt0(X1,xR,xz) )
| sdtmndtplgtdt0(xx,xR,xz)
| sdtmndtasgtdt0(xx,xR,xz) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
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,negated_conjecture,
! [X4] :
( ( aElement0(esk1_0)
| aReductOfIn0(xy,xx,xR)
| xx = xy )
& ( aReductOfIn0(esk1_0,xx,xR)
| aReductOfIn0(xy,xx,xR)
| xx = xy )
& ( sdtmndtplgtdt0(esk1_0,xR,xy)
| aReductOfIn0(xy,xx,xR)
| xx = xy )
& ( sdtmndtplgtdt0(xx,xR,xy)
| xx = xy )
& sdtmndtasgtdt0(xx,xR,xy)
& ( aElement0(esk2_0)
| aReductOfIn0(xz,xy,xR)
| xy = xz )
& ( aReductOfIn0(esk2_0,xy,xR)
| aReductOfIn0(xz,xy,xR)
| xy = xz )
& ( sdtmndtplgtdt0(esk2_0,xR,xz)
| aReductOfIn0(xz,xy,xR)
| xy = xz )
& ( sdtmndtplgtdt0(xy,xR,xz)
| xy = xz )
& sdtmndtasgtdt0(xy,xR,xz)
& xx != xz
& ~ aReductOfIn0(xz,xx,xR)
& ( ~ aElement0(X4)
| ~ aReductOfIn0(X4,xx,xR)
| ~ sdtmndtplgtdt0(X4,xR,xz) )
& ~ sdtmndtplgtdt0(xx,xR,xz)
& ~ sdtmndtasgtdt0(xx,xR,xz) ),
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_3])])])])])])]) ).
cnf(c_0_6,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_7,negated_conjecture,
( xy = xz
| sdtmndtplgtdt0(xy,xR,xz) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_9,hypothesis,
aElement0(xy),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_10,hypothesis,
aElement0(xz),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_11,negated_conjecture,
( xy = xz
| 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_6,c_0_7]),c_0_8]),c_0_9]),c_0_10])]) ).
cnf(c_0_12,negated_conjecture,
( xx = xy
| sdtmndtplgtdt0(xx,xR,xy) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_14,negated_conjecture,
~ sdtmndtplgtdt0(xx,xR,xz),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
sdtmndtasgtdt0(xy,xR,xz),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( xy = xx
| xy = xz ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
~ sdtmndtasgtdt0(xx,xR,xz),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
xy = xz,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,negated_conjecture,
xx != xz,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_18]),c_0_18]),c_0_19]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM012+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n004.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 : Thu Jun 16 19:35:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.016 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 21
% 0.22/1.41 # Proof object clause steps : 15
% 0.22/1.41 # Proof object formula steps : 6
% 0.22/1.41 # Proof object conjectures : 13
% 0.22/1.41 # Proof object clause conjectures : 10
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 11
% 0.22/1.41 # Proof object initial formulas used : 3
% 0.22/1.41 # Proof object generating inferences : 3
% 0.22/1.41 # Proof object simplifying inferences : 12
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 10
% 0.22/1.41 # Removed by relevancy pruning/SinE : 1
% 0.22/1.41 # Initial clauses : 32
% 0.22/1.41 # Removed in clause preprocessing : 3
% 0.22/1.41 # Initial clauses in saturation : 29
% 0.22/1.41 # Processed clauses : 58
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 11
% 0.22/1.41 # ...remaining for further processing : 47
% 0.22/1.41 # Other redundant clauses eliminated : 1
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 3
% 0.22/1.41 # Backward-rewritten : 24
% 0.22/1.41 # Generated clauses : 79
% 0.22/1.41 # ...of the previous two non-trivial : 82
% 0.22/1.41 # Contextual simplify-reflections : 9
% 0.22/1.41 # Paramodulations : 77
% 0.22/1.41 # Factorizations : 1
% 0.22/1.41 # Equation resolutions : 1
% 0.22/1.41 # Current number of processed clauses : 19
% 0.22/1.41 # Positive orientable unit clauses : 4
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 4
% 0.22/1.41 # Non-unit-clauses : 11
% 0.22/1.41 # Current number of unprocessed clauses: 15
% 0.22/1.41 # ...number of literals in the above : 52
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 27
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 99
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 30
% 0.22/1.41 # Non-unit clause-clause subsumptions : 22
% 0.22/1.41 # Unit Clause-clause subsumption calls : 2
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 1
% 0.22/1.41 # BW rewrite match successes : 1
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 3340
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.016 s
% 0.22/1.41 # System time : 0.005 s
% 0.22/1.41 # Total time : 0.021 s
% 0.22/1.41 # Maximum resident set size: 3052 pages
%------------------------------------------------------------------------------