TSTP Solution File: KLE065+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE065+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 : Sun Jul 17 01:49:57 EDT 2022
% Result : Theorem 7.46s 2.32s
% Output : CNFRefutation 7.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 7 RR)
% Number of literals : 25 ( 24 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_q2q5h6t/input.p',i_0_13) ).
cnf(i_0_15,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_q2q5h6t/input.p',i_0_15) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_q2q5h6t/input.p',i_0_2) ).
cnf(i_0_7,plain,
addition(domain(X1),one) = one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_q2q5h6t/input.p',i_0_7) ).
cnf(i_0_5,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_q2q5h6t/input.p',i_0_5) ).
cnf(i_0_6,plain,
domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_q2q5h6t/input.p',i_0_6) ).
cnf(i_0_11,negated_conjecture,
multiplication(esk1_0,esk2_0) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_q2q5h6t/input.p',i_0_11) ).
cnf(i_0_8,plain,
domain(zero) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_q2q5h6t/input.p',i_0_8) ).
cnf(i_0_12,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_q2q5h6t/input.p',i_0_12) ).
cnf(i_0_10,negated_conjecture,
multiplication(esk1_0,domain(esk2_0)) != zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_q2q5h6t/input.p',i_0_10) ).
cnf(c_0_26,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_13 ).
cnf(c_0_27,plain,
multiplication(one,X1) = X1,
i_0_15 ).
cnf(c_0_28,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_29,plain,
addition(domain(X1),one) = one,
i_0_7 ).
cnf(c_0_30,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
i_0_5 ).
cnf(c_0_31,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_32,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_33,plain,
multiplication(domain(X1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_28]),c_0_32]),c_0_27]) ).
cnf(c_0_34,plain,
domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
i_0_6 ).
cnf(c_0_35,plain,
multiplication(domain(multiplication(X1,X2)),multiplication(X1,domain(X2))) = multiplication(X1,domain(X2)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
multiplication(esk1_0,esk2_0) = zero,
i_0_11 ).
cnf(c_0_37,plain,
domain(zero) = zero,
i_0_8 ).
cnf(c_0_38,plain,
multiplication(zero,X1) = zero,
i_0_12 ).
cnf(c_0_39,negated_conjecture,
multiplication(esk1_0,domain(esk2_0)) != zero,
i_0_10 ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE065+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 07:45:58 EDT 2022
% 0.13/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
% 7.46/2.32 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.46/2.32 # Version: 2.1pre011
% 7.46/2.32 # Preprocessing time : 0.011 s
% 7.46/2.32
% 7.46/2.32 # Proof found!
% 7.46/2.32 # SZS status Theorem
% 7.46/2.32 # SZS output start CNFRefutation
% See solution above
% 7.46/2.32 # Proof object total steps : 25
% 7.46/2.32 # Proof object clause steps : 15
% 7.46/2.32 # Proof object formula steps : 10
% 7.46/2.32 # Proof object conjectures : 5
% 7.46/2.32 # Proof object clause conjectures : 3
% 7.46/2.32 # Proof object formula conjectures : 2
% 7.46/2.32 # Proof object initial clauses used : 10
% 7.46/2.32 # Proof object initial formulas used : 10
% 7.46/2.32 # Proof object generating inferences : 3
% 7.46/2.32 # Proof object simplifying inferences : 9
% 7.46/2.32 # Training examples: 0 positive, 0 negative
% 7.46/2.32 # Parsed axioms : 20
% 7.46/2.32 # Removed by relevancy pruning/SinE : 0
% 7.46/2.32 # Initial clauses : 20
% 7.46/2.32 # Removed in clause preprocessing : 0
% 7.46/2.32 # Initial clauses in saturation : 20
% 7.46/2.32 # Processed clauses : 153
% 7.46/2.32 # ...of these trivial : 49
% 7.46/2.32 # ...subsumed : 18
% 7.46/2.32 # ...remaining for further processing : 86
% 7.46/2.32 # Other redundant clauses eliminated : 0
% 7.46/2.32 # Clauses deleted for lack of memory : 0
% 7.46/2.32 # Backward-subsumed : 0
% 7.46/2.32 # Backward-rewritten : 6
% 7.46/2.32 # Generated clauses : 2392
% 7.46/2.32 # ...of the previous two non-trivial : 1324
% 7.46/2.32 # Contextual simplify-reflections : 0
% 7.46/2.32 # Paramodulations : 2392
% 7.46/2.32 # Factorizations : 0
% 7.46/2.32 # Equation resolutions : 0
% 7.46/2.32 # Propositional unsat checks : 0
% 7.46/2.32 # Propositional unsat check successes : 0
% 7.46/2.32 # Current number of processed clauses : 80
% 7.46/2.32 # Positive orientable unit clauses : 74
% 7.46/2.32 # Positive unorientable unit clauses: 3
% 7.46/2.32 # Negative unit clauses : 1
% 7.46/2.32 # Non-unit-clauses : 2
% 7.46/2.32 # Current number of unprocessed clauses: 1019
% 7.46/2.32 # ...number of literals in the above : 1019
% 7.46/2.32 # Current number of archived formulas : 0
% 7.46/2.32 # Current number of archived clauses : 6
% 7.46/2.32 # Clause-clause subsumption calls (NU) : 0
% 7.46/2.32 # Rec. Clause-clause subsumption calls : 0
% 7.46/2.32 # Non-unit clause-clause subsumptions : 0
% 7.46/2.32 # Unit Clause-clause subsumption calls : 9
% 7.46/2.32 # Rewrite failures with RHS unbound : 0
% 7.46/2.32 # BW rewrite match attempts : 111
% 7.46/2.32 # BW rewrite match successes : 47
% 7.46/2.32 # Condensation attempts : 0
% 7.46/2.32 # Condensation successes : 0
% 7.46/2.32 # Termbank termtop insertions : 28640
% 7.46/2.32
% 7.46/2.32 # -------------------------------------------------
% 7.46/2.32 # User time : 0.025 s
% 7.46/2.32 # System time : 0.003 s
% 7.46/2.32 # Total time : 0.028 s
% 7.46/2.32 # ...preprocessing : 0.011 s
% 7.46/2.32 # ...main loop : 0.017 s
% 7.46/2.32 # Maximum resident set size: 7128 pages
% 7.46/2.32
%------------------------------------------------------------------------------