TSTP Solution File: RNG041-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : RNG041-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 : n032.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:40 EDT 2023
% Result : Unsatisfiable 0.15s 0.50s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 19
% Syntax : Number of formulae : 35 ( 15 unt; 10 typ; 0 def)
% Number of atoms : 42 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 36 ( 19 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 6 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 5 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,
multiplicative_identity: $i ).
tff(decl_29,type,
h: $i > $i ).
tff(decl_30,type,
a: $i ).
tff(decl_31,type,
b: $i ).
cnf(multiplication_is_well_defined,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',multiplication_is_well_defined) ).
cnf(multiplicative_identity2,hypothesis,
product(X1,additive_identity,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_identity2) ).
cnf(associativity_of_multiplication2,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/RNG001-0.ax',associativity_of_multiplication2) ).
cnf(a_times_b,negated_conjecture,
product(a,b,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_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(left_multiplicative_identity,hypothesis,
product(multiplicative_identity,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_multiplicative_identity) ).
cnf(clause42,hypothesis,
( product(h(X1),X1,multiplicative_identity)
| X1 = additive_identity ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause42) ).
cnf(a_not_additive_identity,negated_conjecture,
a != additive_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_not_additive_identity) ).
cnf(prove_b_is_additive_identity,negated_conjecture,
b != additive_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_b_is_additive_identity) ).
cnf(c_0_9,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
multiplication_is_well_defined ).
cnf(c_0_10,hypothesis,
product(X1,additive_identity,additive_identity),
multiplicative_identity2 ).
cnf(c_0_11,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
associativity_of_multiplication2 ).
cnf(c_0_12,negated_conjecture,
product(a,b,additive_identity),
a_times_b ).
cnf(c_0_13,hypothesis,
( X1 = additive_identity
| ~ product(X2,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_15,negated_conjecture,
( product(X1,b,X2)
| ~ product(X3,additive_identity,X2)
| ~ product(X3,a,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
multiply(X1,additive_identity) = additive_identity,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,hypothesis,
product(multiplicative_identity,X1,X1),
left_multiplicative_identity ).
cnf(c_0_18,negated_conjecture,
( product(X1,b,additive_identity)
| ~ product(X2,a,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_16]) ).
cnf(c_0_19,hypothesis,
( product(h(X1),X1,multiplicative_identity)
| X1 = additive_identity ),
clause42 ).
cnf(c_0_20,negated_conjecture,
a != additive_identity,
a_not_additive_identity ).
cnf(c_0_21,hypothesis,
( X1 = X2
| ~ product(multiplicative_identity,X2,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_22,hypothesis,
product(multiplicative_identity,b,additive_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,negated_conjecture,
b != additive_identity,
prove_b_is_additive_identity ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : RNG041-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.10 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun Aug 27 01:29:29 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.48 start to proof: theBenchmark
% 0.15/0.50 % Version : CSE_E---1.5
% 0.15/0.50 % Problem : theBenchmark.p
% 0.15/0.50 % Proof found
% 0.15/0.50 % SZS status Theorem for theBenchmark.p
% 0.15/0.50 % SZS output start Proof
% See solution above
% 0.15/0.50 % Total time : 0.007000 s
% 0.15/0.50 % SZS output end Proof
% 0.15/0.50 % Total time : 0.009000 s
%------------------------------------------------------------------------------