TSTP Solution File: GRP009-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP009-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 : n019.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 00:13:35 EDT 2023
% Result : Unsatisfiable 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of formulae : 41 ( 24 unt; 7 typ; 0 def)
% Number of atoms : 52 ( 9 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 20 ~; 18 |; 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 : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
identity: $i ).
tff(decl_23,type,
product: ( $i * $i * $i ) > $o ).
tff(decl_24,type,
inverse: $i > $i ).
tff(decl_25,type,
multiply: ( $i * $i ) > $i ).
tff(decl_26,type,
a: $i ).
tff(decl_27,type,
b: $i ).
tff(decl_28,type,
c: $i ).
cnf(associativity2,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',associativity2) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',left_inverse) ).
cnf(right_identity,axiom,
product(X1,identity,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',right_identity) ).
cnf(total_function2,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',total_function2) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',left_identity) ).
cnf(c_is_an_inverse_of_b,hypothesis,
product(c,b,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_an_inverse_of_b) ).
cnf(total_function1,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',total_function1) ).
cnf(a_is_an_inverse_of_b,hypothesis,
product(a,b,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_an_inverse_of_b) ).
cnf(right_inverse,axiom,
product(X1,inverse(X1),identity),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',right_inverse) ).
cnf(prove_a_equals_c,negated_conjecture,
a != c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_equals_c) ).
cnf(c_0_10,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
associativity2 ).
cnf(c_0_11,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_12,plain,
( product(identity,X1,X2)
| ~ product(inverse(X3),X4,X2)
| ~ product(X3,X1,X4) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
product(X1,identity,X1),
right_identity ).
cnf(c_0_14,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
total_function2 ).
cnf(c_0_15,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_16,hypothesis,
product(c,b,identity),
c_is_an_inverse_of_b ).
cnf(c_0_17,axiom,
product(X1,X2,multiply(X1,X2)),
total_function1 ).
cnf(c_0_18,plain,
( product(identity,X1,inverse(X2))
| ~ product(X2,X1,identity) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,hypothesis,
product(a,b,identity),
a_is_an_inverse_of_b ).
cnf(c_0_20,plain,
( X1 = X2
| ~ product(identity,X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,hypothesis,
( product(identity,X1,X2)
| ~ product(b,X1,X3)
| ~ product(c,X3,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_22,plain,
( multiply(X1,X2) = X3
| ~ product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_23,hypothesis,
product(identity,b,inverse(a)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
multiply(identity,X1) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_25,hypothesis,
( product(identity,X1,c)
| ~ product(b,X1,identity) ),
inference(spm,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_26,axiom,
product(X1,inverse(X1),identity),
right_inverse ).
cnf(c_0_27,hypothesis,
inverse(a) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_28,hypothesis,
product(identity,inverse(b),c),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,hypothesis,
product(b,a,identity),
inference(spm,[status(thm)],[c_0_11,c_0_27]) ).
cnf(c_0_30,hypothesis,
inverse(b) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_28]),c_0_24]) ).
cnf(c_0_31,hypothesis,
product(identity,a,c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_29]),c_0_30]) ).
cnf(c_0_32,negated_conjecture,
a != c,
prove_a_equals_c ).
cnf(c_0_33,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_31]),c_0_24]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP009-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.16/0.34 % Computer : n019.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Mon Aug 28 23:07:28 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.20/0.58 % Version : CSE_E---1.5
% 0.20/0.58 % Problem : theBenchmark.p
% 0.20/0.58 % Proof found
% 0.20/0.58 % SZS status Theorem for theBenchmark.p
% 0.20/0.58 % SZS output start Proof
% See solution above
% 0.20/0.58 % Total time : 0.007000 s
% 0.20/0.58 % SZS output end Proof
% 0.20/0.58 % Total time : 0.009000 s
%------------------------------------------------------------------------------