TSTP Solution File: GRP029-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP029-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/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 00:13:43 EDT 2023
% Result : Unsatisfiable 0.21s 0.59s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 23 ( 10 unt; 5 typ; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 38 ( 20 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
multiply: ( $i * $i ) > $i ).
tff(decl_23,type,
product: ( $i * $i * $i ) > $o ).
tff(decl_24,type,
identity: $i ).
tff(decl_25,type,
inverse: $i > $i ).
tff(decl_26,type,
not_right_identity: $i > $i ).
cnf(associativity1,axiom,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP002-0.ax',associativity1) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
cnf(associativity2,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP002-0.ax',associativity2) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
cnf(prove_there_is_a_right_identity,negated_conjecture,
~ product(not_right_identity(X1),X1,not_right_identity(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_right_identity) ).
cnf(c_0_5,axiom,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
associativity1 ).
cnf(c_0_6,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_7,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
associativity2 ).
cnf(c_0_8,plain,
( product(X1,X2,X3)
| ~ product(X1,X4,identity)
| ~ product(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_10,plain,
( product(X1,X2,X3)
| ~ product(X4,identity,X1)
| ~ product(X4,X2,X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_11,plain,
( product(X1,identity,X2)
| ~ product(X1,inverse(X2),identity) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( product(X1,X2,identity)
| ~ product(inverse(X2),identity,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_13,plain,
product(inverse(inverse(X1)),identity,X1),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_14,plain,
product(X1,inverse(X1),identity),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
~ product(not_right_identity(X1),X1,not_right_identity(X1)),
prove_there_is_a_right_identity ).
cnf(c_0_16,plain,
product(X1,identity,X1),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_15,c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GRP029-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 02:31:41 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.57 start to proof: theBenchmark
% 0.21/0.59 % Version : CSE_E---1.5
% 0.21/0.59 % Problem : theBenchmark.p
% 0.21/0.59 % Proof found
% 0.21/0.59 % SZS status Theorem for theBenchmark.p
% 0.21/0.59 % SZS output start Proof
% See solution above
% 0.21/0.59 % Total time : 0.006000 s
% 0.21/0.59 % SZS output end Proof
% 0.21/0.59 % Total time : 0.008000 s
%------------------------------------------------------------------------------