TSTP Solution File: KLE083+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE083+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:50:02 EDT 2022
% Result : Theorem 6.93s 2.42s
% Output : CNFRefutation 6.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 3 RR)
% Number of literals : 19 ( 18 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xvh2e4mv/lgb.p',i_0_4) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xvh2e4mv/lgb.p',i_0_2) ).
cnf(i_0_15,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xvh2e4mv/lgb.p',i_0_15) ).
cnf(i_0_9,plain,
multiplication(antidomain(X1),X1) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xvh2e4mv/lgb.p',i_0_9) ).
cnf(i_0_11,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xvh2e4mv/lgb.p',i_0_11) ).
cnf(i_0_17,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xvh2e4mv/lgb.p',i_0_17) ).
cnf(i_0_13,negated_conjecture,
multiplication(antidomain(antidomain(esk1_0)),esk1_0) != esk1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xvh2e4mv/lgb.p',i_0_13) ).
cnf(c_0_25,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_26,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_27,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_15 ).
cnf(c_0_28,plain,
multiplication(antidomain(X1),X1) = zero,
i_0_9 ).
cnf(c_0_29,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
i_0_11 ).
cnf(c_0_31,plain,
multiplication(addition(antidomain(X1),X2),X1) = multiplication(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_32,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_33,plain,
multiplication(one,X1) = X1,
i_0_17 ).
cnf(c_0_34,negated_conjecture,
multiplication(antidomain(antidomain(esk1_0)),esk1_0) != esk1_0,
i_0_13 ).
cnf(c_0_35,plain,
multiplication(antidomain(antidomain(X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KLE083+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n003.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Thu Jun 16 15:33:13 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.93/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.93/2.42 # No SInE strategy applied
% 6.93/2.42 # Trying AutoSched0 for 150 seconds
% 6.93/2.42 # AutoSched0-Mode selected heuristic G_____0010_evo
% 6.93/2.42 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.93/2.42 #
% 6.93/2.42 # Preprocessing time : 0.012 s
% 6.93/2.42
% 6.93/2.42 # Proof found!
% 6.93/2.42 # SZS status Theorem
% 6.93/2.42 # SZS output start CNFRefutation
% See solution above
% 6.93/2.42 # Training examples: 0 positive, 0 negative
% 6.93/2.42
% 6.93/2.42 # -------------------------------------------------
% 6.93/2.42 # User time : 0.018 s
% 6.93/2.42 # System time : 0.001 s
% 6.93/2.42 # Total time : 0.020 s
% 6.93/2.42 # Maximum resident set size: 7120 pages
% 6.93/2.42
%------------------------------------------------------------------------------