TSTP Solution File: KLE054+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : KLE054+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n024.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:53 EDT 2023
% Result : Theorem 0.57s 0.63s
% Output : CNFRefutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 41 ( 33 unt; 8 typ; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 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 : 46 ( 4 sgn; 28 !; 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(domain3,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain3) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(goals,conjecture,
! [X4,X5] : addition(domain(multiplication(X4,X5)),domain(X4)) = domain(X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(domain1,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain1) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(domain5,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain5) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(domain2,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain2) ).
fof(c_0_8,plain,
! [X31] : addition(domain(X31),one) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_9,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_10,negated_conjecture,
~ ! [X4,X5] : addition(domain(multiplication(X4,X5)),domain(X4)) = domain(X4),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_11,plain,
! [X28] : addition(X28,multiplication(domain(X28),X28)) = multiplication(domain(X28),X28),
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_12,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_13,plain,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,negated_conjecture,
addition(domain(multiplication(esk1_0,esk2_0)),domain(esk1_0)) != domain(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_16,plain,
! [X32,X33] : domain(addition(X32,X33)) = addition(domain(X32),domain(X33)),
inference(variable_rename,[status(thm)],[domain5]) ).
cnf(c_0_17,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
addition(domain(multiplication(esk1_0,esk2_0)),domain(esk1_0)) != domain(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X18,X19,X20] : multiplication(X18,addition(X19,X20)) = addition(multiplication(X18,X19),multiplication(X18,X20)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_22,plain,
! [X29,X30] : domain(multiplication(X29,X30)) = domain(multiplication(X29,domain(X30))),
inference(variable_rename,[status(thm)],[domain2]) ).
cnf(c_0_23,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
domain(one) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_25,negated_conjecture,
addition(domain(esk1_0),domain(multiplication(esk1_0,esk2_0))) != domain(esk1_0),
inference(rw,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_26,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
domain(addition(one,X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_19]) ).
cnf(c_0_29,negated_conjecture,
domain(addition(esk1_0,multiplication(esk1_0,esk2_0))) != domain(esk1_0),
inference(rw,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_30,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_18]),c_0_14]) ).
cnf(c_0_31,plain,
domain(multiplication(X1,addition(one,X2))) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_14]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE054+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n024.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 : 300
% 0.13/0.34 % DateTime : Tue Aug 29 11:44:53 EDT 2023
% 0.19/0.34 % CPUTime :
% 0.19/0.60 start to proof: theBenchmark
% 0.57/0.63 % Version : CSE_E---1.5
% 0.57/0.63 % Problem : theBenchmark.p
% 0.57/0.63 % Proof found
% 0.57/0.63 % SZS status Theorem for theBenchmark.p
% 0.57/0.63 % SZS output start Proof
% See solution above
% 0.57/0.64 % Total time : 0.027000 s
% 0.57/0.64 % SZS output end Proof
% 0.57/0.64 % Total time : 0.030000 s
%------------------------------------------------------------------------------