TSTP Solution File: KLE005+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KLE005+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n011.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 : 300s
% DateTime : Thu Aug 31 05:25:31 EDT 2023
% Result : Theorem 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of formulae : 29 ( 8 unt; 9 typ; 0 def)
% Number of atoms : 48 ( 25 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 47 ( 19 ~; 17 |; 6 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 7 >; 4 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn; 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
addition: ( $i * $i ) > $i ).
tff(decl_23,type,
zero: $i ).
tff(decl_24,type,
multiplication: ( $i * $i ) > $i ).
tff(decl_25,type,
one: $i ).
tff(decl_26,type,
leq: ( $i * $i ) > $o ).
tff(decl_27,type,
test: $i > $o ).
tff(decl_28,type,
complement: ( $i * $i ) > $o ).
tff(decl_29,type,
c: $i > $i ).
tff(decl_30,type,
esk1_1: $i > $i ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(test_4,axiom,
! [X4] :
( ~ test(X4)
=> c(X4) = zero ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_4) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(goals,conjecture,
c(one) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(c_0_5,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_6,plain,
! [X4] :
( ~ test(X4)
=> c(X4) = zero ),
inference(fof_simplification,[status(thm)],[test_4]) ).
fof(c_0_7,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_8,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
c(one) != zero,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).
fof(c_0_10,plain,
! [X36] :
( test(X36)
| c(X36) = zero ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_11,plain,
! [X17] : multiplication(one,X17) = X17,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_12,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
c(one) != zero,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( test(X1)
| c(X1) = zero ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( multiplication(X1,c(X1)) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
test(one),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE005+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 11:10:26 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.58 start to proof: theBenchmark
% 0.21/0.60 % Version : CSE_E---1.5
% 0.21/0.60 % Problem : theBenchmark.p
% 0.21/0.60 % Proof found
% 0.21/0.60 % SZS status Theorem for theBenchmark.p
% 0.21/0.60 % SZS output start Proof
% See solution above
% 0.21/0.60 % Total time : 0.007000 s
% 0.21/0.60 % SZS output end Proof
% 0.21/0.60 % Total time : 0.010000 s
%------------------------------------------------------------------------------