TSTP Solution File: KLE065+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KLE065+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:56 EDT 2023
% Result : Theorem 0.19s 0.59s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 14
% Syntax : Number of formulae : 29 ( 18 unt; 8 typ; 0 def)
% Number of atoms : 24 ( 23 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 21 ( 1 sgn; 14 !; 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,
domain: $i > $i ).
tff(decl_28,type,
esk1_0: $i ).
tff(decl_29,type,
esk2_0: $i ).
fof(domain1,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain1) ).
fof(domain2,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain2) ).
fof(goals,conjecture,
! [X4,X5] :
( multiplication(X4,X5) = zero
=> multiplication(X4,domain(X5)) = zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(domain4,axiom,
domain(zero) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain4) ).
fof(c_0_6,plain,
! [X28] : addition(X28,multiplication(domain(X28),X28)) = multiplication(domain(X28),X28),
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_7,plain,
! [X29,X30] : domain(multiplication(X29,X30)) = domain(multiplication(X29,domain(X30))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_8,negated_conjecture,
~ ! [X4,X5] :
( multiplication(X4,X5) = zero
=> multiplication(X4,domain(X5)) = zero ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_9,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,negated_conjecture,
( multiplication(esk1_0,esk2_0) = zero
& multiplication(esk1_0,domain(esk2_0)) != zero ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_12,plain,
! [X25] : multiplication(zero,X25) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_13,plain,
! [X11] : addition(X11,zero) = X11,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_14,plain,
addition(multiplication(X1,domain(X2)),multiplication(domain(multiplication(X1,X2)),multiplication(X1,domain(X2)))) = multiplication(domain(multiplication(X1,X2)),multiplication(X1,domain(X2))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
multiplication(esk1_0,esk2_0) = zero,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
domain(zero) = zero,
inference(split_conjunct,[status(thm)],[domain4]) ).
cnf(c_0_17,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
multiplication(esk1_0,domain(esk2_0)) != zero,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_16]),c_0_17]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KLE065+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 29 11:02:11 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.19/0.59 % Version : CSE_E---1.5
% 0.19/0.59 % Problem : theBenchmark.p
% 0.19/0.59 % Proof found
% 0.19/0.59 % SZS status Theorem for theBenchmark.p
% 0.19/0.59 % SZS output start Proof
% See solution above
% 0.19/0.59 % Total time : 0.029000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.033000 s
%------------------------------------------------------------------------------