TSTP Solution File: GRP061-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP061-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 00:15:26 EDT 2023
% Result : Unsatisfiable 1.75s 1.87s
% Output : CNFRefutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 11
% Syntax : Number of formulae : 54 ( 42 unt; 9 typ; 0 def)
% Number of atoms : 50 ( 49 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 9 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 16 ( 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 : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 132 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
inverse: $i > $i ).
tff(decl_23,type,
multiply: ( $i * $i ) > $i ).
tff(decl_24,type,
a1: $i ).
tff(decl_25,type,
b1: $i ).
tff(decl_26,type,
b2: $i ).
tff(decl_27,type,
a2: $i ).
tff(decl_28,type,
a3: $i ).
tff(decl_29,type,
b3: $i ).
tff(decl_30,type,
c3: $i ).
cnf(single_axiom,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),X3),inverse(multiply(X4,multiply(X1,X3))))))) = X4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(c_0_2,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),X3),inverse(multiply(X4,multiply(X1,X3))))))) = X4,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(inverse(X1),X3),inverse(multiply(X4,multiply(X5,X3))))),X4)))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(multiply(X1,multiply(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),X4),inverse(multiply(X5,multiply(X2,X4)))))),multiply(multiply(X5,X6),inverse(multiply(X7,multiply(X1,X6))))))) = X7,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_5,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(inverse(X1),multiply(multiply(inverse(X3),X4),inverse(multiply(X5,multiply(X6,X4))))),X5)),X6)))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_6,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(inverse(X1),multiply(multiply(X3,X4),inverse(multiply(X5,multiply(X6,X4))))),X5)),X6)))) = multiply(X7,multiply(X8,multiply(multiply(inverse(X8),X9),inverse(multiply(X3,multiply(X7,X9)))))),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,plain,
multiply(a1,multiply(a1,multiply(multiply(inverse(a1),a1),inverse(multiply(inverse(X1),multiply(a1,a1)))))) = X1,
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
multiply(a1,multiply(a1,multiply(multiply(inverse(a1),a1),inverse(multiply(X1,multiply(a1,a1)))))) = multiply(X2,multiply(X3,multiply(multiply(inverse(X3),X4),inverse(multiply(X1,multiply(X2,X4)))))),
inference(spm,[status(thm)],[c_0_7,c_0_2]) ).
cnf(c_0_9,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),X3),inverse(multiply(inverse(X4),multiply(X1,X3)))))) = X4,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
inverse(multiply(X1,multiply(X2,multiply(X3,inverse(multiply(X4,multiply(X1,multiply(X5,multiply(multiply(inverse(X5),X6),inverse(multiply(inverse(X3),multiply(inverse(X2),X6)))))))))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_9]) ).
cnf(c_0_11,plain,
inverse(multiply(inverse(X1),multiply(X1,multiply(X2,inverse(multiply(X3,X2)))))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_6]),c_0_6]),c_0_7]) ).
cnf(c_0_12,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(X3,inverse(multiply(X4,X3)))),X4))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_11]),c_0_6]),c_0_7]) ).
cnf(c_0_13,plain,
inverse(multiply(X1,multiply(X2,multiply(inverse(X2),inverse(multiply(X3,X1)))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_12]),c_0_12]) ).
cnf(c_0_14,plain,
multiply(X1,multiply(X2,multiply(inverse(X2),inverse(multiply(inverse(X3),X1))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_12]) ).
cnf(c_0_15,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(X3,multiply(inverse(X3),inverse(multiply(X4,X5)))),X4)),X5))) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
multiply(multiply(X1,multiply(X2,inverse(multiply(X3,X2)))),multiply(X4,multiply(inverse(X4),X3))) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_17,plain,
multiply(X1,multiply(X2,multiply(inverse(X2),multiply(multiply(X3,multiply(inverse(X3),inverse(X4))),X4)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_15]),c_0_15]) ).
cnf(c_0_18,plain,
multiply(X1,multiply(X2,inverse(multiply(multiply(multiply(X3,multiply(inverse(X3),inverse(X4))),X4),X2)))) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(inverse(X1),multiply(multiply(inverse(X3),multiply(multiply(inverse(X4),multiply(multiply(inverse(X5),X6),inverse(multiply(X7,multiply(X8,X6))))),X7)),X8)),X5)),X4)))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_20,plain,
inverse(multiply(inverse(X1),X1)) = multiply(multiply(X2,multiply(inverse(X2),inverse(X3))),X3),
inference(spm,[status(thm)],[c_0_2,c_0_18]) ).
cnf(c_0_21,plain,
multiply(inverse(a1),a1) = multiply(inverse(X1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_20]),c_0_19]) ).
cnf(c_0_22,plain,
multiply(X1,multiply(inverse(a1),a1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_21]),c_0_20]),c_0_21]) ).
cnf(c_0_23,plain,
multiply(X1,multiply(inverse(X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_24,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_23]) ).
cnf(c_0_25,plain,
inverse(multiply(X1,inverse(X1))) = multiply(inverse(a1),a1),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_26,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25]),c_0_22]),c_0_24]) ).
cnf(c_0_27,plain,
inverse(multiply(X1,inverse(multiply(X2,X1)))) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_23]) ).
cnf(c_0_28,plain,
multiply(multiply(X1,multiply(X2,inverse(multiply(multiply(inverse(inverse(X3)),inverse(multiply(inverse(X4),X3))),X2)))),X4) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_29,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
multiply(multiply(X1,inverse(X2)),X2) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_26]),c_0_29]),c_0_26]) ).
cnf(c_0_31,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_29]),c_0_26]) ).
cnf(c_0_32,plain,
multiply(multiply(inverse(a1),a1),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_21]),c_0_26]) ).
cnf(c_0_33,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_31,c_0_26]) ).
cnf(c_0_34,plain,
inverse(multiply(multiply(X1,multiply(inverse(X1),inverse(multiply(X2,X3)))),multiply(X4,multiply(inverse(X4),X2)))) = X3,
inference(spm,[status(thm)],[c_0_13,c_0_13]) ).
cnf(c_0_35,plain,
multiply(multiply(inverse(X1),X1),X2) = X2,
inference(spm,[status(thm)],[c_0_32,c_0_21]) ).
cnf(c_0_36,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
prove_these_axioms ).
cnf(c_0_37,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_12]),c_0_29]),c_0_30]) ).
cnf(c_0_38,plain,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_33]),c_0_33]),c_0_33]) ).
cnf(c_0_39,plain,
multiply(multiply(X1,inverse(X1)),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_13]),c_0_33]),c_0_29]) ).
cnf(c_0_40,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2 ),
inference(sr,[status(thm)],[c_0_36,c_0_21]) ).
cnf(c_0_41,plain,
multiply(X1,multiply(X2,multiply(inverse(multiply(X1,X2)),X3))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_37]),c_0_26]),c_0_38]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_35])]) ).
cnf(c_0_43,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_33]),c_0_26]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : GRP061-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.10 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.10/0.31 % Computer : n002.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Aug 29 00:26:04 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.54 start to proof: theBenchmark
% 1.75/1.87 % Version : CSE_E---1.5
% 1.75/1.87 % Problem : theBenchmark.p
% 1.75/1.87 % Proof found
% 1.75/1.87 % SZS status Theorem for theBenchmark.p
% 1.75/1.87 % SZS output start Proof
% See solution above
% 1.75/1.87 % Total time : 1.321000 s
% 1.75/1.87 % SZS output end Proof
% 1.75/1.87 % Total time : 1.323000 s
%------------------------------------------------------------------------------