TSTP Solution File: KLE021+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE021+3 : TPTP v8.1.0. Released v4.0.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 : Sun Jul 17 01:49:38 EDT 2022
% Result : Theorem 8.92s 2.62s
% Output : CNFRefutation 8.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 15 unt; 0 def)
% Number of atoms : 51 ( 29 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 43 ( 17 ~; 14 |; 7 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(goals,conjecture,
! [X4,X5] :
( test(X5)
=> X4 = addition(multiplication(X5,X4),multiplication(c(X5),X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(c_0_6,plain,
! [X34,X35] :
( ( c(X34) != X35
| complement(X34,X35)
| ~ test(X34) )
& ( ~ complement(X34,X35)
| c(X34) = X35
| ~ test(X34) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X4,X5] :
( test(X5)
=> X4 = addition(multiplication(X5,X4),multiplication(c(X5),X4)) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_8,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,negated_conjecture,
( test(esk3_0)
& esk2_0 != addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,plain,
! [X32,X33] :
( ( multiplication(X32,X33) = zero
| ~ complement(X33,X32) )
& ( multiplication(X33,X32) = zero
| ~ complement(X33,X32) )
& ( addition(X32,X33) = one
| ~ complement(X33,X32) )
& ( multiplication(X32,X33) != zero
| multiplication(X33,X32) != zero
| addition(X32,X33) != one
| complement(X33,X32) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_11,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_14,plain,
! [X21,X22,X23] : multiplication(addition(X21,X22),X23) = addition(multiplication(X21,X23),multiplication(X22,X23)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_15,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
complement(esk3_0,c(esk3_0)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X17] : multiplication(one,X17) = X17,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_19,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
addition(esk3_0,c(esk3_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_21,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
esk2_0 != addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
addition(multiplication(esk3_0,X1),multiplication(c(esk3_0),X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KLE021+3 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n029.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 10:26:14 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.92/2.62 # ENIGMATIC: Solved by autoschedule:
% 8.92/2.62 # No SInE strategy applied
% 8.92/2.62 # Trying AutoSched0 for 150 seconds
% 8.92/2.62 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S064A
% 8.92/2.62 # and selection function SelectComplexG.
% 8.92/2.62 #
% 8.92/2.62 # Preprocessing time : 0.022 s
% 8.92/2.62 # Presaturation interreduction done
% 8.92/2.62
% 8.92/2.62 # Proof found!
% 8.92/2.62 # SZS status Theorem
% 8.92/2.62 # SZS output start CNFRefutation
% See solution above
% 8.92/2.62 # Training examples: 0 positive, 0 negative
% 8.92/2.62
% 8.92/2.62 # -------------------------------------------------
% 8.92/2.62 # User time : 0.042 s
% 8.92/2.62 # System time : 0.005 s
% 8.92/2.62 # Total time : 0.047 s
% 8.92/2.62 # Maximum resident set size: 7112 pages
% 8.92/2.62
%------------------------------------------------------------------------------