TSTP Solution File: KLE055+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE055+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:54 EDT 2022
% Result : Theorem 7.44s 2.34s
% Output : CNFRefutation 7.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 6 RR)
% Number of literals : 20 ( 19 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_20,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5_nv1v8u/input.p',i_0_20) ).
cnf(i_0_16,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5_nv1v8u/input.p',i_0_16) ).
cnf(i_0_11,negated_conjecture,
addition(esk1_0,one) = one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5_nv1v8u/input.p',i_0_11) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5_nv1v8u/input.p',i_0_2) ).
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5_nv1v8u/input.p',i_0_1) ).
cnf(i_0_5,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5_nv1v8u/input.p',i_0_5) ).
cnf(i_0_10,negated_conjecture,
addition(esk1_0,domain(esk1_0)) != domain(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5_nv1v8u/input.p',i_0_10) ).
cnf(c_0_28,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_20 ).
cnf(c_0_29,plain,
multiplication(X1,one) = X1,
i_0_16 ).
cnf(c_0_30,negated_conjecture,
addition(esk1_0,one) = one,
i_0_11 ).
cnf(c_0_31,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_32,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(one,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
addition(one,esk1_0) = one,
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_35,negated_conjecture,
addition(X1,multiplication(X1,esk1_0)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_29]) ).
cnf(c_0_36,plain,
addition(X1,addition(multiplication(X1,esk1_0),X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
addition(X1,addition(X2,multiplication(X1,esk1_0))) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_36,c_0_31]) ).
cnf(c_0_38,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
i_0_5 ).
cnf(c_0_39,negated_conjecture,
addition(esk1_0,domain(esk1_0)) != domain(esk1_0),
i_0_10 ).
cnf(c_0_40,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_35]),c_0_31]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : KLE055+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 16 11:40:54 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.44/2.34 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.44/2.34 # Version: 2.1pre011
% 7.44/2.34 # Preprocessing time : 0.014 s
% 7.44/2.34
% 7.44/2.34 # Proof found!
% 7.44/2.34 # SZS status Theorem
% 7.44/2.34 # SZS output start CNFRefutation
% See solution above
% 7.44/2.34 # Proof object total steps : 20
% 7.44/2.34 # Proof object clause steps : 13
% 7.44/2.34 # Proof object formula steps : 7
% 7.44/2.34 # Proof object conjectures : 6
% 7.44/2.34 # Proof object clause conjectures : 4
% 7.44/2.34 # Proof object formula conjectures : 2
% 7.44/2.34 # Proof object initial clauses used : 7
% 7.44/2.34 # Proof object initial formulas used : 7
% 7.44/2.34 # Proof object generating inferences : 5
% 7.44/2.34 # Proof object simplifying inferences : 5
% 7.44/2.34 # Training examples: 0 positive, 0 negative
% 7.44/2.34 # Parsed axioms : 20
% 7.44/2.34 # Removed by relevancy pruning/SinE : 0
% 7.44/2.34 # Initial clauses : 20
% 7.44/2.34 # Removed in clause preprocessing : 0
% 7.44/2.34 # Initial clauses in saturation : 20
% 7.44/2.34 # Processed clauses : 303
% 7.44/2.34 # ...of these trivial : 89
% 7.44/2.34 # ...subsumed : 100
% 7.44/2.34 # ...remaining for further processing : 113
% 7.44/2.34 # Other redundant clauses eliminated : 0
% 7.44/2.34 # Clauses deleted for lack of memory : 0
% 7.44/2.34 # Backward-subsumed : 0
% 7.44/2.34 # Backward-rewritten : 10
% 7.44/2.34 # Generated clauses : 4680
% 7.44/2.34 # ...of the previous two non-trivial : 2661
% 7.44/2.34 # Contextual simplify-reflections : 0
% 7.44/2.34 # Paramodulations : 4680
% 7.44/2.34 # Factorizations : 0
% 7.44/2.34 # Equation resolutions : 0
% 7.44/2.34 # Propositional unsat checks : 0
% 7.44/2.34 # Propositional unsat check successes : 0
% 7.44/2.34 # Current number of processed clauses : 103
% 7.44/2.34 # Positive orientable unit clauses : 93
% 7.44/2.34 # Positive unorientable unit clauses: 7
% 7.44/2.34 # Negative unit clauses : 1
% 7.44/2.34 # Non-unit-clauses : 2
% 7.44/2.34 # Current number of unprocessed clauses: 2152
% 7.44/2.34 # ...number of literals in the above : 2152
% 7.44/2.34 # Current number of archived formulas : 0
% 7.44/2.34 # Current number of archived clauses : 10
% 7.44/2.34 # Clause-clause subsumption calls (NU) : 0
% 7.44/2.34 # Rec. Clause-clause subsumption calls : 0
% 7.44/2.34 # Non-unit clause-clause subsumptions : 0
% 7.44/2.34 # Unit Clause-clause subsumption calls : 12
% 7.44/2.34 # Rewrite failures with RHS unbound : 0
% 7.44/2.34 # BW rewrite match attempts : 256
% 7.44/2.34 # BW rewrite match successes : 67
% 7.44/2.34 # Condensation attempts : 0
% 7.44/2.34 # Condensation successes : 0
% 7.44/2.34 # Termbank termtop insertions : 54151
% 7.44/2.34
% 7.44/2.34 # -------------------------------------------------
% 7.44/2.34 # User time : 0.042 s
% 7.44/2.34 # System time : 0.003 s
% 7.44/2.34 # Total time : 0.045 s
% 7.44/2.34 # ...preprocessing : 0.014 s
% 7.44/2.34 # ...main loop : 0.031 s
% 7.44/2.34 # Maximum resident set size: 7132 pages
% 7.44/2.34
%------------------------------------------------------------------------------