TSTP Solution File: GRP433-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP433-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n018.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:20:16 EDT 2023
% Result : Unsatisfiable 0.55s 0.65s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 6
% Syntax : Number of formulae : 45 ( 41 unt; 4 typ; 0 def)
% Number of atoms : 41 ( 40 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 10 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 93 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
multiply: ( $i * $i ) > $i ).
tff(decl_23,type,
inverse: $i > $i ).
tff(decl_24,type,
a1: $i ).
tff(decl_25,type,
b1: $i ).
cnf(single_axiom,axiom,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4)))) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(c_0_2,axiom,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4)))) = X3,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(multiply(multiply(X1,multiply(inverse(multiply(multiply(X2,X3),X1)),X2)),X3),multiply(X4,inverse(X4)))) = multiply(X5,inverse(X5)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(multiply(multiply(multiply(inverse(multiply(X1,inverse(X1))),X2),X3),multiply(X4,inverse(X4)))) = inverse(multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_6,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,inverse(X1)),X2)),X3),inverse(X3)),multiply(X4,inverse(X4)))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_7,plain,
inverse(multiply(multiply(multiply(inverse(multiply(X1,X2)),multiply(inverse(multiply(a1,inverse(a1))),X1)),X2),multiply(X3,inverse(X3)))) = multiply(X4,inverse(X4)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_3]),c_0_3]) ).
cnf(c_0_8,plain,
inverse(multiply(multiply(inverse(multiply(multiply(X1,X2),inverse(multiply(X3,inverse(X3))))),X1),X2)) = multiply(X4,inverse(X4)),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(X1)) = inverse(multiply(inverse(multiply(a1,inverse(a1))),multiply(X2,inverse(X2)))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
inverse(multiply(multiply(inverse(multiply(X1,inverse(X1))),X2),inverse(X2))) = multiply(X3,inverse(X3)),
inference(spm,[status(thm)],[c_0_8,c_0_4]) ).
cnf(c_0_11,plain,
multiply(X1,inverse(X1)) = inverse(multiply(inverse(multiply(X2,inverse(X2))),multiply(X3,inverse(X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_12,plain,
inverse(multiply(multiply(X1,inverse(X1)),inverse(inverse(inverse(multiply(X2,inverse(X2))))))) = multiply(X3,inverse(X3)),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_13,plain,
multiply(multiply(multiply(X1,inverse(X1)),inverse(inverse(inverse(multiply(X2,inverse(X2)))))),multiply(X3,inverse(X3))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_11]) ).
cnf(c_0_14,plain,
inverse(multiply(inverse(inverse(multiply(X1,inverse(X1)))),inverse(inverse(inverse(multiply(X2,inverse(X2))))))) = inverse(multiply(a1,inverse(a1))),
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_15,plain,
multiply(multiply(inverse(inverse(multiply(X1,inverse(X1)))),inverse(inverse(inverse(multiply(X2,inverse(X2)))))),inverse(multiply(a1,inverse(a1)))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_14]),c_0_11]) ).
cnf(c_0_16,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(a1,inverse(a1)))) = multiply(a1,inverse(a1)),
inference(spm,[status(thm)],[c_0_15,c_0_4]) ).
cnf(c_0_17,plain,
multiply(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4))),X3) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_2]),c_0_3]) ).
cnf(c_0_18,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,inverse(X2)))) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_16,c_0_4]) ).
cnf(c_0_19,plain,
inverse(multiply(multiply(inverse(multiply(a1,inverse(a1))),multiply(X1,inverse(X1))),inverse(multiply(a1,inverse(a1))))) = multiply(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_16]),c_0_5]) ).
cnf(c_0_20,plain,
multiply(multiply(multiply(multiply(X1,inverse(X1)),X2),multiply(X3,inverse(X3))),inverse(X2)) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_10]),c_0_18]) ).
cnf(c_0_21,plain,
inverse(multiply(multiply(a1,inverse(a1)),multiply(X1,inverse(X1)))) = multiply(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_19]),c_0_16]),c_0_5]) ).
cnf(c_0_22,plain,
inverse(multiply(multiply(multiply(X1,inverse(X1)),X2),multiply(X3,inverse(X3)))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_20]),c_0_5]) ).
cnf(c_0_23,plain,
inverse(multiply(multiply(X1,inverse(X1)),multiply(X2,inverse(X2)))) = multiply(X3,inverse(X3)),
inference(spm,[status(thm)],[c_0_21,c_0_4]) ).
cnf(c_0_24,plain,
inverse(inverse(multiply(a1,inverse(a1)))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_23]) ).
cnf(c_0_25,plain,
inverse(multiply(multiply(multiply(a1,inverse(a1)),multiply(X1,inverse(X1))),multiply(X2,inverse(X2)))) = inverse(multiply(a1,inverse(a1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_19]),c_0_16]) ).
cnf(c_0_26,plain,
inverse(multiply(a1,inverse(a1))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_24]),c_0_12]) ).
cnf(c_0_27,plain,
inverse(multiply(X1,inverse(X1))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_22]),c_0_26]) ).
cnf(c_0_28,plain,
inverse(multiply(multiply(a1,inverse(a1)),X1)) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_22]),c_0_27]),c_0_27]) ).
cnf(c_0_29,plain,
inverse(multiply(multiply(X1,inverse(X1)),X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_28,c_0_4]) ).
cnf(c_0_30,plain,
inverse(inverse(inverse(inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_22]),c_0_29]) ).
cnf(c_0_31,plain,
multiply(multiply(X1,inverse(X1)),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_29]),c_0_30]) ).
cnf(c_0_32,plain,
inverse(multiply(X1,multiply(a1,inverse(a1)))) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_31]),c_0_31]),c_0_27]) ).
cnf(c_0_33,plain,
multiply(X1,multiply(a1,inverse(a1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_32]),c_0_30]) ).
cnf(c_0_34,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(multiply(multiply(multiply(inverse(multiply(multiply(X4,X5),X6)),X4),X5),multiply(X7,inverse(X7))),X6))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_35,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_4]) ).
cnf(c_0_36,plain,
inverse(multiply(inverse(multiply(X1,X2)),X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_31]),c_0_17]),c_0_35]) ).
cnf(c_0_37,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_31]),c_0_35]) ).
cnf(c_0_38,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
prove_these_axioms_1 ).
cnf(c_0_39,plain,
multiply(inverse(X1),X1) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_37]),c_0_10]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP433-1 : TPTP v8.1.2. Released v2.6.0.
% 0.06/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n018.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 : Mon Aug 28 22:01:47 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.55/0.65 % Version : CSE_E---1.5
% 0.55/0.65 % Problem : theBenchmark.p
% 0.55/0.65 % Proof found
% 0.55/0.65 % SZS status Theorem for theBenchmark.p
% 0.55/0.65 % SZS output start Proof
% See solution above
% 0.55/0.65 % Total time : 0.084000 s
% 0.55/0.65 % SZS output end Proof
% 0.55/0.65 % Total time : 0.087000 s
%------------------------------------------------------------------------------