TSTP Solution File: HAL003+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : HAL003+3 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : Sat Jul 16 12:45:05 EDT 2022
% Result : Theorem 8.72s 2.56s
% Output : CNFRefutation 8.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 5 unt; 2 nHn; 20 RR)
% Number of literals : 47 ( 6 equ; 29 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_52,plain,
( surjection(X1)
| apply(X1,X2) != esk14_3(X1,X3,X4)
| ~ element(X2,X3)
| ~ morphism(X1,X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bpmeqt5f/input.p',i_0_52) ).
cnf(i_0_56,plain,
( element(subtract(X1,X2,X3),X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bpmeqt5f/input.p',i_0_56) ).
cnf(i_0_25,plain,
( apply(g,subtract(b,esk2_1(X1),esk3_1(X1))) = X1
| ~ element(X1,e) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bpmeqt5f/input.p',i_0_25) ).
cnf(i_0_21,negated_conjecture,
~ surjection(g),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bpmeqt5f/input.p',i_0_21) ).
cnf(i_0_27,plain,
( element(esk2_1(X1),b)
| ~ element(X1,e) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bpmeqt5f/input.p',i_0_27) ).
cnf(i_0_26,plain,
( element(esk3_1(X1),b)
| ~ element(X1,e) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bpmeqt5f/input.p',i_0_26) ).
cnf(i_0_53,plain,
( surjection(X1)
| element(esk14_3(X1,X2,X3),X3)
| ~ morphism(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bpmeqt5f/input.p',i_0_53) ).
cnf(i_0_20,plain,
morphism(g,b,e),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bpmeqt5f/input.p',i_0_20) ).
cnf(c_0_65,plain,
( surjection(X1)
| apply(X1,X2) != esk14_3(X1,X3,X4)
| ~ element(X2,X3)
| ~ morphism(X1,X3,X4) ),
i_0_52 ).
cnf(c_0_66,plain,
( element(subtract(X1,X2,X3),X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
i_0_56 ).
cnf(c_0_67,plain,
( surjection(X1)
| apply(X1,subtract(X2,X3,X4)) != esk14_3(X1,X2,X5)
| ~ element(X4,X2)
| ~ element(X3,X2)
| ~ morphism(X1,X2,X5) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_68,plain,
( apply(g,subtract(b,esk2_1(X1),esk3_1(X1))) = X1
| ~ element(X1,e) ),
i_0_25 ).
cnf(c_0_69,negated_conjecture,
~ surjection(g),
i_0_21 ).
cnf(c_0_70,plain,
( element(esk2_1(X1),b)
| ~ element(X1,e) ),
i_0_27 ).
cnf(c_0_71,plain,
( element(esk3_1(X1),b)
| ~ element(X1,e) ),
i_0_26 ).
cnf(c_0_72,plain,
( X1 != esk14_3(g,b,X2)
| ~ element(X1,e)
| ~ morphism(g,b,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70]),c_0_71]) ).
cnf(c_0_73,plain,
( ~ element(esk14_3(g,b,X1),e)
| ~ morphism(g,b,X1) ),
inference(er,[status(thm)],[c_0_72]) ).
cnf(c_0_74,plain,
( surjection(X1)
| element(esk14_3(X1,X2,X3),X3)
| ~ morphism(X1,X2,X3) ),
i_0_53 ).
cnf(c_0_75,plain,
morphism(g,b,e),
i_0_20 ).
cnf(c_0_76,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75])]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : HAL003+3 : TPTP v8.1.0. Released v2.6.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.36 % Computer : n029.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Tue Jun 7 21:31:52 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected SinE mode:
% 0.22/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.72/2.56 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.72/2.56 # Version: 2.1pre011
% 8.72/2.56 # Preprocessing time : 0.011 s
% 8.72/2.56
% 8.72/2.56 # Proof found!
% 8.72/2.56 # SZS status Theorem
% 8.72/2.56 # SZS output start CNFRefutation
% See solution above
% 8.72/2.56 # Proof object total steps : 20
% 8.72/2.56 # Proof object clause steps : 12
% 8.72/2.56 # Proof object formula steps : 8
% 8.72/2.56 # Proof object conjectures : 2
% 8.72/2.56 # Proof object clause conjectures : 1
% 8.72/2.56 # Proof object formula conjectures : 1
% 8.72/2.56 # Proof object initial clauses used : 8
% 8.72/2.56 # Proof object initial formulas used : 8
% 8.72/2.56 # Proof object generating inferences : 4
% 8.72/2.56 # Proof object simplifying inferences : 6
% 8.72/2.56 # Training examples: 0 positive, 0 negative
% 8.72/2.56 # Parsed axioms : 59
% 8.72/2.56 # Removed by relevancy pruning/SinE : 0
% 8.72/2.56 # Initial clauses : 59
% 8.72/2.56 # Removed in clause preprocessing : 0
% 8.72/2.56 # Initial clauses in saturation : 59
% 8.72/2.56 # Processed clauses : 77
% 8.72/2.56 # ...of these trivial : 0
% 8.72/2.56 # ...subsumed : 1
% 8.72/2.56 # ...remaining for further processing : 76
% 8.72/2.56 # Other redundant clauses eliminated : 0
% 8.72/2.56 # Clauses deleted for lack of memory : 0
% 8.72/2.56 # Backward-subsumed : 0
% 8.72/2.56 # Backward-rewritten : 0
% 8.72/2.56 # Generated clauses : 170
% 8.72/2.56 # ...of the previous two non-trivial : 157
% 8.72/2.56 # Contextual simplify-reflections : 3
% 8.72/2.56 # Paramodulations : 168
% 8.72/2.56 # Factorizations : 0
% 8.72/2.56 # Equation resolutions : 2
% 8.72/2.56 # Propositional unsat checks : 0
% 8.72/2.56 # Propositional unsat check successes : 0
% 8.72/2.56 # Current number of processed clauses : 76
% 8.72/2.56 # Positive orientable unit clauses : 19
% 8.72/2.56 # Positive unorientable unit clauses: 0
% 8.72/2.56 # Negative unit clauses : 1
% 8.72/2.56 # Non-unit-clauses : 56
% 8.72/2.56 # Current number of unprocessed clauses: 139
% 8.72/2.56 # ...number of literals in the above : 532
% 8.72/2.56 # Current number of archived formulas : 0
% 8.72/2.56 # Current number of archived clauses : 0
% 8.72/2.56 # Clause-clause subsumption calls (NU) : 308
% 8.72/2.56 # Rec. Clause-clause subsumption calls : 94
% 8.72/2.56 # Non-unit clause-clause subsumptions : 4
% 8.72/2.56 # Unit Clause-clause subsumption calls : 2
% 8.72/2.56 # Rewrite failures with RHS unbound : 0
% 8.72/2.56 # BW rewrite match attempts : 0
% 8.72/2.56 # BW rewrite match successes : 0
% 8.72/2.56 # Condensation attempts : 0
% 8.72/2.56 # Condensation successes : 0
% 8.72/2.56 # Termbank termtop insertions : 4465
% 8.72/2.56
% 8.72/2.56 # -------------------------------------------------
% 8.72/2.56 # User time : 0.011 s
% 8.72/2.56 # System time : 0.004 s
% 8.72/2.56 # Total time : 0.015 s
% 8.72/2.56 # ...preprocessing : 0.011 s
% 8.72/2.56 # ...main loop : 0.004 s
% 8.72/2.56 # Maximum resident set size: 7124 pages
% 8.72/2.56
%------------------------------------------------------------------------------