TSTP Solution File: RNG037-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : RNG037-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n002.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 13:48:39 EDT 2023
% Result : Unsatisfiable 0.18s 0.64s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 23
% Syntax : Number of formulae : 74 ( 35 unt; 10 typ; 0 def)
% Number of atoms : 117 ( 18 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 108 ( 55 ~; 53 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 5 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 144 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
additive_identity: $i ).
tff(decl_23,type,
sum: ( $i * $i * $i ) > $o ).
tff(decl_24,type,
multiply: ( $i * $i ) > $i ).
tff(decl_25,type,
product: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
add: ( $i * $i ) > $i ).
tff(decl_27,type,
additive_inverse: $i > $i ).
tff(decl_28,type,
a: $i ).
tff(decl_29,type,
b: $i ).
tff(decl_30,type,
d: $i ).
tff(decl_31,type,
c: $i ).
cnf(addition_is_well_defined,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',addition_is_well_defined) ).
cnf(additive_identity2,axiom,
sum(X1,additive_identity,X1),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',additive_identity2) ).
cnf(associativity_of_addition2,axiom,
( sum(X3,X4,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',associativity_of_addition2) ).
cnf(left_inverse,axiom,
sum(additive_inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',left_inverse) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',closure_of_addition) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',additive_identity1) ).
cnf(distributivity1,axiom,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ product(X1,X6,X7) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',distributivity1) ).
cnf(a_times_b,hypothesis,
product(a,b,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_b) ).
cnf(commutativity_of_addition,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',commutativity_of_addition) ).
cnf(a_inverse_times_b,hypothesis,
product(a,additive_inverse(b),c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_inverse_times_b) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',closure_of_multiplication) ).
cnf(associativity_of_addition1,axiom,
( sum(X1,X5,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X3,X4,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',associativity_of_addition1) ).
cnf(prove_sum_is_additive_identity,negated_conjecture,
~ sum(c,d,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_sum_is_additive_identity) ).
cnf(c_0_13,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
addition_is_well_defined ).
cnf(c_0_14,axiom,
sum(X1,additive_identity,X1),
additive_identity2 ).
cnf(c_0_15,axiom,
( sum(X3,X4,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X5,X6) ),
associativity_of_addition2 ).
cnf(c_0_16,axiom,
sum(additive_inverse(X1),X1,additive_identity),
left_inverse ).
cnf(c_0_17,plain,
( X1 = X2
| ~ sum(X2,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_19,plain,
( sum(X1,X2,X3)
| ~ sum(X4,additive_inverse(X2),X1)
| ~ sum(X4,additive_identity,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
add(X1,additive_identity) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_22,plain,
( sum(X1,X2,X3)
| ~ sum(X3,additive_inverse(X2),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_20]) ).
cnf(c_0_23,plain,
( X1 = X2
| ~ sum(additive_identity,X2,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_24,axiom,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ product(X1,X6,X7) ),
distributivity1 ).
cnf(c_0_25,hypothesis,
product(a,b,d),
a_times_b ).
cnf(c_0_26,plain,
( X1 = add(X2,X3)
| ~ sum(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_27,plain,
sum(additive_identity,X1,additive_inverse(additive_inverse(X1))),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_28,plain,
add(additive_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_29,plain,
sum(add(X1,additive_inverse(X2)),X2,X1),
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_30,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
commutativity_of_addition ).
cnf(c_0_31,hypothesis,
( sum(X1,X2,d)
| ~ product(a,X3,X2)
| ~ product(a,X4,X1)
| ~ sum(X4,X3,b) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,hypothesis,
product(a,additive_inverse(b),c),
a_inverse_times_b ).
cnf(c_0_33,plain,
additive_inverse(additive_inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_34,plain,
( X1 = X2
| ~ sum(add(X2,additive_inverse(X3)),X3,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_29]) ).
cnf(c_0_35,plain,
sum(X1,X2,add(X2,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_18]) ).
cnf(c_0_36,hypothesis,
( sum(X1,c,d)
| ~ product(a,X2,X1)
| ~ sum(X2,additive_inverse(b),b) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_38,axiom,
( sum(X1,X5,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X3,X4,X6) ),
associativity_of_addition1 ).
cnf(c_0_39,plain,
( sum(X1,additive_inverse(X2),X3)
| ~ sum(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_33]) ).
cnf(c_0_40,plain,
( X1 = X2
| ~ sum(add(X2,X3),additive_inverse(X3),X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_33]) ).
cnf(c_0_41,plain,
add(X1,X2) = add(X2,X1),
inference(spm,[status(thm)],[c_0_26,c_0_35]) ).
cnf(c_0_42,hypothesis,
( sum(multiply(a,X1),c,d)
| ~ sum(X1,additive_inverse(b),b) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
sum(add(additive_inverse(X1),X2),X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_35]) ).
cnf(c_0_44,plain,
( sum(X1,X2,additive_identity)
| ~ sum(X1,X3,additive_inverse(X4))
| ~ sum(X3,X4,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_16]) ).
cnf(c_0_45,plain,
sum(add(X1,X2),additive_inverse(X2),X1),
inference(spm,[status(thm)],[c_0_39,c_0_18]) ).
cnf(c_0_46,plain,
( sum(X1,X2,multiply(X3,X4))
| ~ product(X3,X5,X2)
| ~ product(X3,X6,X1)
| ~ sum(X6,X5,X4) ),
inference(spm,[status(thm)],[c_0_24,c_0_37]) ).
cnf(c_0_47,plain,
( X1 = X2
| ~ sum(add(X3,X2),additive_inverse(X3),X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,hypothesis,
sum(multiply(a,add(b,b)),c,d),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_33]) ).
cnf(c_0_49,plain,
( sum(X1,X2,additive_identity)
| ~ sum(X1,add(X2,X3),X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_33]) ).
cnf(c_0_50,hypothesis,
( sum(X1,d,multiply(a,X2))
| ~ product(a,X3,X1)
| ~ sum(X3,b,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_25]) ).
cnf(c_0_51,plain,
add(additive_inverse(X1),add(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_18]),c_0_41]) ).
cnf(c_0_52,hypothesis,
add(c,multiply(a,add(b,b))) = d,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_48]),c_0_41]) ).
cnf(c_0_53,plain,
add(X1,add(X2,additive_inverse(X1))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_29]),c_0_41]) ).
cnf(c_0_54,plain,
( sum(X1,X2,additive_identity)
| ~ sum(X1,add(X3,X2),X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_41]) ).
cnf(c_0_55,hypothesis,
( sum(d,d,multiply(a,X1))
| ~ sum(b,b,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_25]) ).
cnf(c_0_56,hypothesis,
multiply(a,add(b,b)) = add(d,additive_inverse(c)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_41]) ).
cnf(c_0_57,plain,
add(additive_inverse(X1),add(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_53,c_0_33]) ).
cnf(c_0_58,plain,
( sum(X1,add(X2,additive_inverse(X3)),additive_identity)
| ~ sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_54,c_0_53]) ).
cnf(c_0_59,hypothesis,
sum(d,d,add(d,additive_inverse(c))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_18]),c_0_56]) ).
cnf(c_0_60,plain,
add(X1,additive_inverse(add(X1,X2))) = additive_inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_57]),c_0_41]) ).
cnf(c_0_61,hypothesis,
sum(d,c,additive_identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_33]) ).
cnf(c_0_62,negated_conjecture,
~ sum(c,d,additive_identity),
prove_sum_is_additive_identity ).
cnf(c_0_63,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_61]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : RNG037-1 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n002.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 : Sun Aug 27 03:15:03 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.57 start to proof: theBenchmark
% 0.18/0.64 % Version : CSE_E---1.5
% 0.18/0.64 % Problem : theBenchmark.p
% 0.18/0.64 % Proof found
% 0.18/0.64 % SZS status Theorem for theBenchmark.p
% 0.18/0.64 % SZS output start Proof
% See solution above
% 0.18/0.65 % Total time : 0.058000 s
% 0.18/0.65 % SZS output end Proof
% 0.18/0.65 % Total time : 0.060000 s
%------------------------------------------------------------------------------