TSTP Solution File: COM022+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : COM022+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 188 ( 13 equ)
% Maximal formula atoms : 41 ( 5 avg)
% Number of connectives : 240 ( 87 ~; 87 |; 56 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-3 aty)
% Number of variables : 38 ( 1 sgn 15 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ( sdtmndtplgtdt0(xa,xR,xb)
& sdtmndtplgtdt0(xa,xR,xc) )
=> ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xa,xR)
& sdtmndtasgtdt0(X1,xR,xb)
& ? [X2] :
( aElement0(X2)
& aReductOfIn0(X2,xa,xR)
& sdtmndtasgtdt0(X2,xR,xc)
& ? [X3] :
( aElement0(X3)
& sdtmndtasgtdt0(X1,xR,X3)
& sdtmndtasgtdt0(X2,xR,X3)
& ? [X4] :
( aNormalFormOfIn0(X4,X3,xR)
& sdtmndtasgtdt0(xb,xR,X4)
& sdtmndtasgtdt0(xc,xR,X4) ) ) ) ) )
=> ( ( sdtmndtasgtdt0(xa,xR,xb)
& sdtmndtasgtdt0(xa,xR,xc) )
=> ? [X1] :
( aElement0(X1)
& sdtmndtasgtdt0(xb,xR,X1)
& sdtmndtasgtdt0(xc,xR,X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mNFRDef,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aRewritingSystem0(X2) )
=> ! [X3] :
( aNormalFormOfIn0(X3,X1,X2)
<=> ( aElement0(X3)
& sdtmndtasgtdt0(X1,X2,X3)
& ~ ? [X4] : aReductOfIn0(X4,X3,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mNFRDef) ).
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(c_0_5,negated_conjecture,
~ ( ( ( sdtmndtplgtdt0(xa,xR,xb)
& sdtmndtplgtdt0(xa,xR,xc) )
=> ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xa,xR)
& sdtmndtasgtdt0(X1,xR,xb)
& ? [X2] :
( aElement0(X2)
& aReductOfIn0(X2,xa,xR)
& sdtmndtasgtdt0(X2,xR,xc)
& ? [X3] :
( aElement0(X3)
& sdtmndtasgtdt0(X1,xR,X3)
& sdtmndtasgtdt0(X2,xR,X3)
& ? [X4] :
( aNormalFormOfIn0(X4,X3,xR)
& sdtmndtasgtdt0(xb,xR,X4)
& sdtmndtasgtdt0(xc,xR,X4) ) ) ) ) )
=> ( ( sdtmndtasgtdt0(xa,xR,xb)
& sdtmndtasgtdt0(xa,xR,xc) )
=> ? [X1] :
( aElement0(X1)
& sdtmndtasgtdt0(xb,xR,X1)
& sdtmndtasgtdt0(xc,xR,X1) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
! [X9] :
( ( aElement0(esk2_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( aReductOfIn0(esk2_0,xa,xR)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( sdtmndtasgtdt0(esk2_0,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( aElement0(esk3_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( aReductOfIn0(esk3_0,xa,xR)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( sdtmndtasgtdt0(esk3_0,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( aElement0(esk4_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( sdtmndtasgtdt0(esk2_0,xR,esk4_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( sdtmndtasgtdt0(esk3_0,xR,esk4_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( aNormalFormOfIn0(esk5_0,esk4_0,xR)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( sdtmndtasgtdt0(xb,xR,esk5_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& ( sdtmndtasgtdt0(xc,xR,esk5_0)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) )
& sdtmndtasgtdt0(xa,xR,xb)
& sdtmndtasgtdt0(xa,xR,xc)
& ( ~ aElement0(X9)
| ~ sdtmndtasgtdt0(xb,xR,X9)
| ~ sdtmndtasgtdt0(xc,xR,X9) ) ),
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,
! [X5,X6,X7,X8,X7] :
( ( aElement0(X7)
| ~ aNormalFormOfIn0(X7,X5,X6)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6) )
& ( sdtmndtasgtdt0(X5,X6,X7)
| ~ aNormalFormOfIn0(X7,X5,X6)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6) )
& ( ~ aReductOfIn0(X8,X7,X6)
| ~ aNormalFormOfIn0(X7,X5,X6)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6) )
& ( ~ aElement0(X7)
| ~ sdtmndtasgtdt0(X5,X6,X7)
| aReductOfIn0(esk13_3(X5,X6,X7),X7,X6)
| aNormalFormOfIn0(X7,X5,X6)
| ~ aElement0(X5)
| ~ 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)],[mNFRDef])])])])])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ sdtmndtasgtdt0(xc,xR,X1)
| ~ sdtmndtasgtdt0(xb,xR,X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( sdtmndtasgtdt0(xc,xR,esk5_0)
| ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( sdtmndtasgtdt0(xb,xR,esk5_0)
| ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,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_12,plain,
( aElement0(X3)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( aNormalFormOfIn0(esk5_0,esk4_0,xR)
| ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__656]) ).
cnf(c_0_15,negated_conjecture,
( aElement0(esk4_0)
| ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ aElement0(esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_17,plain,
( sdtmndtplgtdt0(X3,X2,X1)
| X3 = X1
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtasgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
sdtmndtasgtdt0(xa,xR,xc),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_20,hypothesis,
aElement0(xc),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_21,negated_conjecture,
( ~ sdtmndtplgtdt0(xa,xR,xb)
| ~ sdtmndtplgtdt0(xa,xR,xc) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]),c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( xa = xc
| sdtmndtplgtdt0(xa,xR,xc) ),
inference(cn,[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_14]),c_0_19]),c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
sdtmndtasgtdt0(xa,xR,xb),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_25,negated_conjecture,
( xa = xc
| ~ sdtmndtplgtdt0(xa,xR,xb) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( xa = xb
| sdtmndtplgtdt0(xa,xR,xb) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_14]),c_0_19]),c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
( xa = xb
| xa = xc ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( xa = xb
| sdtmndtasgtdt0(xc,xR,xb) ),
inference(spm,[status(thm)],[c_0_23,c_0_27]) ).
cnf(c_0_29,plain,
( sdtmndtasgtdt0(X3,X2,X1)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| X3 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_30,negated_conjecture,
( xa = xb
| ~ sdtmndtasgtdt0(xb,xR,xb) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_28]),c_0_24])]) ).
cnf(c_0_31,plain,
( sdtmndtasgtdt0(X1,X2,X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
xa = xb,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_14]),c_0_24])]) ).
cnf(c_0_33,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xc),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_31]),c_0_20]),c_0_14])]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : COM022+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n029.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 20:07:27 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.021 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 35
% 0.25/1.44 # Proof object clause steps : 26
% 0.25/1.44 # Proof object formula steps : 9
% 0.25/1.44 # Proof object conjectures : 21
% 0.25/1.44 # Proof object clause conjectures : 18
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 14
% 0.25/1.44 # Proof object initial formulas used : 5
% 0.25/1.44 # Proof object generating inferences : 10
% 0.25/1.44 # Proof object simplifying inferences : 24
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 19
% 0.25/1.44 # Removed by relevancy pruning/SinE : 1
% 0.25/1.44 # Initial clauses : 58
% 0.25/1.44 # Removed in clause preprocessing : 4
% 0.25/1.44 # Initial clauses in saturation : 54
% 0.25/1.44 # Processed clauses : 77
% 0.25/1.44 # ...of these trivial : 0
% 0.25/1.44 # ...subsumed : 1
% 0.25/1.44 # ...remaining for further processing : 76
% 0.25/1.44 # Other redundant clauses eliminated : 1
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 14
% 0.25/1.44 # Backward-rewritten : 16
% 0.25/1.44 # Generated clauses : 116
% 0.25/1.44 # ...of the previous two non-trivial : 105
% 0.25/1.44 # Contextual simplify-reflections : 11
% 0.25/1.44 # Paramodulations : 114
% 0.25/1.44 # Factorizations : 1
% 0.25/1.44 # Equation resolutions : 1
% 0.25/1.44 # Current number of processed clauses : 45
% 0.25/1.44 # Positive orientable unit clauses : 6
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 1
% 0.25/1.44 # Non-unit-clauses : 38
% 0.25/1.44 # Current number of unprocessed clauses: 40
% 0.25/1.44 # ...number of literals in the above : 216
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 30
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 645
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 217
% 0.25/1.44 # Non-unit clause-clause subsumptions : 25
% 0.25/1.44 # Unit Clause-clause subsumption calls : 41
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 2
% 0.25/1.44 # BW rewrite match successes : 1
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 6350
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.029 s
% 0.25/1.44 # System time : 0.002 s
% 0.25/1.44 # Total time : 0.031 s
% 0.25/1.44 # Maximum resident set size: 3076 pages
%------------------------------------------------------------------------------