TSTP Solution File: COM021+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : COM021+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.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:07 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 16 unt; 0 def)
% Number of atoms : 131 ( 6 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 173 ( 72 ~; 73 |; 22 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 39 ( 3 sgn 21 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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(m__818,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__818) ).
fof(m__656,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__656) ).
fof(m__799,hypothesis,
( aElement0(xw)
& sdtmndtasgtdt0(xu,xR,xw)
& sdtmndtasgtdt0(xv,xR,xw) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__799) ).
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__,conjecture,
sdtmndtasgtdt0(xb,xR,xd),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__850,hypothesis,
( aElement0(xx)
& sdtmndtasgtdt0(xb,xR,xx)
& sdtmndtasgtdt0(xd,xR,xx) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__850) ).
fof(c_0_8,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(esk10_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_9,plain,
( ~ aRewritingSystem0(X1)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X3,X2,X1)
| ~ aReductOfIn0(X4,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_10,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
inference(split_conjunct,[status(thm)],[m__818]) ).
cnf(c_0_11,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__656]) ).
cnf(c_0_12,hypothesis,
aElement0(xw),
inference(split_conjunct,[status(thm)],[m__799]) ).
fof(c_0_13,plain,
! [X5,X6,X7,X9] :
( ( aElement0(esk9_3(X5,X6,X7))
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( aReductOfIn0(esk9_3(X5,X6,X7),X5,X6)
| aReductOfIn0(X7,X5,X6)
| ~ sdtmndtplgtdt0(X5,X6,X7)
| ~ aElement0(X5)
| ~ aRewritingSystem0(X6)
| ~ aElement0(X7) )
& ( sdtmndtplgtdt0(esk9_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])])])])])])]) ).
cnf(c_0_14,plain,
( aElement0(X3)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,hypothesis,
~ aReductOfIn0(X1,xd,xR),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_16,plain,
( aReductOfIn0(X1,X3,X2)
| aReductOfIn0(esk9_3(X3,X2,X1),X3,X2)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtplgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,hypothesis,
aElement0(xd),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_10]),c_0_11]),c_0_12])]) ).
fof(c_0_18,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_19,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_20,hypothesis,
( ~ sdtmndtplgtdt0(xd,xR,X1)
| ~ aElement0(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_11]),c_0_17])]),c_0_15]) ).
cnf(c_0_21,plain,
( sdtmndtplgtdt0(X3,X2,X1)
| X3 = X1
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ sdtmndtasgtdt0(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_22,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
cnf(c_0_23,hypothesis,
( X1 = xd
| ~ sdtmndtasgtdt0(xd,xR,X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_11]),c_0_17])]) ).
cnf(c_0_24,hypothesis,
sdtmndtasgtdt0(xd,xR,xx),
inference(split_conjunct,[status(thm)],[m__850]) ).
cnf(c_0_25,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__850]) ).
cnf(c_0_26,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,hypothesis,
xd = xx,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_28,hypothesis,
sdtmndtasgtdt0(xb,xR,xx),
inference(split_conjunct,[status(thm)],[m__850]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : COM021+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n014.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 18:31:05 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.019 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 30
% 0.25/1.43 # Proof object clause steps : 17
% 0.25/1.43 # Proof object formula steps : 13
% 0.25/1.43 # Proof object conjectures : 5
% 0.25/1.43 # Proof object clause conjectures : 2
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 11
% 0.25/1.43 # Proof object initial formulas used : 8
% 0.25/1.43 # Proof object generating inferences : 5
% 0.25/1.43 # Proof object simplifying inferences : 18
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 25
% 0.25/1.43 # Removed by relevancy pruning/SinE : 1
% 0.25/1.43 # Initial clauses : 59
% 0.25/1.43 # Removed in clause preprocessing : 4
% 0.25/1.43 # Initial clauses in saturation : 55
% 0.25/1.43 # Processed clauses : 68
% 0.25/1.43 # ...of these trivial : 0
% 0.25/1.43 # ...subsumed : 0
% 0.25/1.43 # ...remaining for further processing : 68
% 0.25/1.43 # Other redundant clauses eliminated : 1
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 8
% 0.25/1.43 # Generated clauses : 68
% 0.25/1.43 # ...of the previous two non-trivial : 63
% 0.25/1.43 # Contextual simplify-reflections : 8
% 0.25/1.43 # Paramodulations : 67
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 1
% 0.25/1.43 # Current number of processed clauses : 59
% 0.25/1.43 # Positive orientable unit clauses : 24
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 0
% 0.25/1.43 # Non-unit-clauses : 35
% 0.25/1.43 # Current number of unprocessed clauses: 41
% 0.25/1.43 # ...number of literals in the above : 218
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 8
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 270
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 33
% 0.25/1.43 # Non-unit clause-clause subsumptions : 8
% 0.25/1.43 # Unit Clause-clause subsumption calls : 77
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 6
% 0.25/1.43 # BW rewrite match successes : 1
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 5023
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.020 s
% 0.25/1.43 # System time : 0.003 s
% 0.25/1.43 # Total time : 0.023 s
% 0.25/1.43 # Maximum resident set size: 3072 pages
%------------------------------------------------------------------------------