TSTP Solution File: COM141+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : COM141+1 : TPTP v8.1.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:07:26 EDT 2022
% Result : Theorem 8.11s 2.51s
% Output : CNFRefutation 8.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 7 unt; 2 nHn; 7 RR)
% Number of literals : 26 ( 11 equ; 14 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 30 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_147,plain,
( vtcheck(vbind(X1,X2,X3),vabs(X4,X5,veabs),X6)
| X1 != X4
| vlookup(X1,X3) != vnoType
| ~ vtcheck(X3,vabs(X4,X5,veabs),X6) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-grqcrxdz/input.p',i_0_147) ).
cnf(i_0_146,plain,
( X1 = X2
| vtcheck(vbind(X1,X3,X4),vabs(X2,X5,veabs),X6)
| vlookup(X1,X4) != vnoType
| ~ vtcheck(X4,vabs(X2,X5,veabs),X6) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-grqcrxdz/input.p',i_0_146) ).
cnf(i_0_148,negated_conjecture,
~ vtcheck(vbind(esk32_0,esk33_0,esk34_0),vabs(esk35_0,esk36_0,veabs),esk37_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-grqcrxdz/input.p',i_0_148) ).
cnf(i_0_150,negated_conjecture,
vlookup(esk32_0,esk34_0) = vnoType,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-grqcrxdz/input.p',i_0_150) ).
cnf(i_0_149,negated_conjecture,
vtcheck(esk34_0,vabs(esk35_0,esk36_0,veabs),esk37_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-grqcrxdz/input.p',i_0_149) ).
cnf(c_0_156,plain,
( vtcheck(vbind(X1,X2,X3),vabs(X4,X5,veabs),X6)
| X1 != X4
| vlookup(X1,X3) != vnoType
| ~ vtcheck(X3,vabs(X4,X5,veabs),X6) ),
i_0_147 ).
cnf(c_0_157,plain,
( X1 = X2
| vtcheck(vbind(X1,X3,X4),vabs(X2,X5,veabs),X6)
| vlookup(X1,X4) != vnoType
| ~ vtcheck(X4,vabs(X2,X5,veabs),X6) ),
i_0_146 ).
cnf(c_0_158,negated_conjecture,
~ vtcheck(vbind(esk32_0,esk33_0,esk34_0),vabs(esk35_0,esk36_0,veabs),esk37_0),
i_0_148 ).
cnf(c_0_159,plain,
( vtcheck(vbind(X1,X2,X3),vabs(X4,X5,veabs),X6)
| vlookup(X1,X3) != vnoType
| ~ vtcheck(X3,vabs(X4,X5,veabs),X6) ),
inference(csr,[status(thm)],[c_0_156,c_0_157]) ).
cnf(c_0_160,negated_conjecture,
vlookup(esk32_0,esk34_0) = vnoType,
i_0_150 ).
cnf(c_0_161,negated_conjecture,
vtcheck(esk34_0,vabs(esk35_0,esk36_0,veabs),esk37_0),
i_0_149 ).
cnf(c_0_162,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_159]),c_0_160]),c_0_161])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : COM141+1 : TPTP v8.1.0. Released v6.4.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 17:17:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.11/2.51 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.11/2.51 # Version: 2.1pre011
% 8.11/2.51 # Preprocessing time : 0.023 s
% 8.11/2.51
% 8.11/2.51 # Proof found!
% 8.11/2.51 # SZS status Theorem
% 8.11/2.51 # SZS output start CNFRefutation
% See solution above
% 8.11/2.51 # Proof object total steps : 12
% 8.11/2.51 # Proof object clause steps : 7
% 8.11/2.51 # Proof object formula steps : 5
% 8.11/2.51 # Proof object conjectures : 7
% 8.11/2.51 # Proof object clause conjectures : 4
% 8.11/2.51 # Proof object formula conjectures : 3
% 8.11/2.51 # Proof object initial clauses used : 5
% 8.11/2.51 # Proof object initial formulas used : 5
% 8.11/2.51 # Proof object generating inferences : 1
% 8.11/2.51 # Proof object simplifying inferences : 4
% 8.11/2.51 # Training examples: 0 positive, 0 negative
% 8.11/2.51 # Parsed axioms : 411
% 8.11/2.51 # Removed by relevancy pruning/SinE : 0
% 8.11/2.51 # Initial clauses : 411
% 8.11/2.51 # Removed in clause preprocessing : 0
% 8.11/2.51 # Initial clauses in saturation : 411
% 8.11/2.51 # Processed clauses : 22
% 8.11/2.51 # ...of these trivial : 0
% 8.11/2.51 # ...subsumed : 0
% 8.11/2.51 # ...remaining for further processing : 22
% 8.11/2.51 # Other redundant clauses eliminated : 0
% 8.11/2.51 # Clauses deleted for lack of memory : 0
% 8.11/2.51 # Backward-subsumed : 1
% 8.11/2.51 # Backward-rewritten : 0
% 8.11/2.51 # Generated clauses : 8
% 8.11/2.51 # ...of the previous two non-trivial : 6
% 8.11/2.51 # Contextual simplify-reflections : 1
% 8.11/2.51 # Paramodulations : 2
% 8.11/2.51 # Factorizations : 0
% 8.11/2.51 # Equation resolutions : 6
% 8.11/2.51 # Propositional unsat checks : 0
% 8.11/2.51 # Propositional unsat check successes : 0
% 8.11/2.51 # Current number of processed clauses : 21
% 8.11/2.51 # Positive orientable unit clauses : 2
% 8.11/2.51 # Positive unorientable unit clauses: 0
% 8.11/2.51 # Negative unit clauses : 7
% 8.11/2.51 # Non-unit-clauses : 12
% 8.11/2.51 # Current number of unprocessed clauses: 394
% 8.11/2.51 # ...number of literals in the above : 1718
% 8.11/2.51 # Current number of archived formulas : 0
% 8.11/2.51 # Current number of archived clauses : 1
% 8.11/2.51 # Clause-clause subsumption calls (NU) : 82
% 8.11/2.51 # Rec. Clause-clause subsumption calls : 55
% 8.11/2.51 # Non-unit clause-clause subsumptions : 2
% 8.11/2.51 # Unit Clause-clause subsumption calls : 20
% 8.11/2.51 # Rewrite failures with RHS unbound : 0
% 8.11/2.51 # BW rewrite match attempts : 0
% 8.11/2.51 # BW rewrite match successes : 0
% 8.11/2.51 # Condensation attempts : 0
% 8.11/2.51 # Condensation successes : 0
% 8.11/2.51 # Termbank termtop insertions : 12928
% 8.11/2.51
% 8.11/2.51 # -------------------------------------------------
% 8.11/2.51 # User time : 0.022 s
% 8.11/2.51 # System time : 0.002 s
% 8.11/2.51 # Total time : 0.024 s
% 8.11/2.51 # ...preprocessing : 0.023 s
% 8.11/2.51 # ...main loop : 0.001 s
% 8.11/2.51 # Maximum resident set size: 7128 pages
% 8.11/2.51
%------------------------------------------------------------------------------