TSTP Solution File: GRP424-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP424-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 : n008.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:12 EDT 2023
% Result : Unsatisfiable 0.16s 0.59s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 17 unt; 4 typ; 0 def)
% Number of atoms : 17 ( 16 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 : 12 ( 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 : 50 ( 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 ).
cnf(single_axiom,axiom,
multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X3)))),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X3),X3))) = X2,
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,
multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X3)))),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X3),X3))) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(inverse(multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(inverse(multiply(inverse(X3),X3)))))),inverse(multiply(inverse(inverse(multiply(inverse(X3),X3))),inverse(multiply(inverse(X3),X3))))) = multiply(inverse(multiply(X4,inverse(multiply(inverse(X2),X3)))),multiply(X4,inverse(X3))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X3)))),multiply(X1,inverse(X3))) = multiply(inverse(multiply(X4,inverse(multiply(inverse(X2),X3)))),multiply(X4,inverse(X3))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(X2),inverse(multiply(inverse(X3),X3)))),X3)))),multiply(X1,inverse(X3))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_6,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(multiply(X3,inverse(X4))))) = multiply(inverse(multiply(X5,inverse(X2))),multiply(X5,inverse(multiply(X3,inverse(X4))))),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(X3))) = multiply(inverse(multiply(X4,inverse(X2))),multiply(X4,inverse(X3))),
inference(spm,[status(thm)],[c_0_6,c_0_2]) ).
cnf(c_0_8,plain,
multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),multiply(X3,inverse(X4)))))),multiply(X1,inverse(multiply(X3,inverse(X4)))))),inverse(multiply(inverse(multiply(X5,inverse(X4))),multiply(X5,inverse(X4))))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_9,plain,
multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),multiply(X3,inverse(multiply(inverse(X4),X4))))))),multiply(X1,inverse(multiply(X3,inverse(multiply(inverse(X4),X4))))))),inverse(multiply(inverse(X5),X5))) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_2]) ).
cnf(c_0_10,plain,
multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X3)))),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X4),X4))) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_9]) ).
cnf(c_0_11,plain,
multiply(inverse(multiply(inverse(X1),multiply(inverse(multiply(inverse(multiply(X2,inverse(multiply(inverse(X1),X3)))),multiply(X2,inverse(X3)))),inverse(X3)))),inverse(multiply(inverse(X3),X3))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_12,plain,
multiply(inverse(X1),inverse(multiply(inverse(X2),X2))) = multiply(inverse(X1),inverse(multiply(inverse(X3),X3))),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_13,plain,
multiply(inverse(multiply(inverse(X1),X1)),inverse(multiply(inverse(a1),a1))) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_12]) ).
cnf(c_0_14,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
prove_these_axioms_1 ).
cnf(c_0_15,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_13,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_14,c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP424-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.11 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.11/0.32 % Computer : n008.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Aug 29 01:32:02 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.55 start to proof: theBenchmark
% 0.16/0.59 % Version : CSE_E---1.5
% 0.16/0.59 % Problem : theBenchmark.p
% 0.16/0.59 % Proof found
% 0.16/0.59 % SZS status Theorem for theBenchmark.p
% 0.16/0.59 % SZS output start Proof
% See solution above
% 0.16/0.59 % Total time : 0.027000 s
% 0.16/0.59 % SZS output end Proof
% 0.16/0.59 % Total time : 0.029000 s
%------------------------------------------------------------------------------