TSTP Solution File: GRP511-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP511-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n026.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:21:23 EDT 2023
% Result : Unsatisfiable 0.20s 0.63s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 28 unt; 5 typ; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 7 ( 2 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 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,
a3: $i ).
tff(decl_25,type,
b3: $i ).
tff(decl_26,type,
c3: $i ).
cnf(single_axiom,axiom,
multiply(multiply(multiply(X1,X2),X3),inverse(multiply(X1,X3))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_0_2,axiom,
multiply(multiply(multiply(X1,X2),X3),inverse(multiply(X1,X3))) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(multiply(X1,X2),inverse(multiply(multiply(multiply(X3,X1),X4),X2))) = inverse(multiply(X3,X4)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,inverse(multiply(multiply(X2,X1),inverse(multiply(X2,X3))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_5,plain,
multiply(multiply(X1,inverse(multiply(X2,X3))),inverse(X1)) = inverse(multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_6,plain,
inverse(multiply(X1,multiply(X2,inverse(multiply(multiply(X1,X2),X3))))) = X3,
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_7,plain,
multiply(multiply(X1,X2),inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(inverse(X2))) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_11,plain,
multiply(multiply(X1,X2),inverse(multiply(X3,X2))) = inverse(multiply(multiply(X4,X3),inverse(multiply(X4,X1)))),
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_12,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_13,plain,
multiply(X1,multiply(multiply(X2,a3),inverse(multiply(X1,a3)))) = X2,
inference(rw,[status(thm)],[c_0_4,c_0_11]) ).
cnf(c_0_14,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_9]),c_0_9]) ).
cnf(c_0_15,plain,
inverse(inverse(inverse(X1))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_12]),c_0_8]) ).
cnf(c_0_16,plain,
multiply(X1,multiply(inverse(multiply(X1,a3)),multiply(X2,a3))) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
cnf(c_0_18,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_19,plain,
multiply(X1,multiply(inverse(multiply(X1,a3)),multiply(a3,X2))) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_20,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_21,plain,
multiply(multiply(X1,X2),X3) = multiply(X2,multiply(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_2]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
prove_these_axioms_3 ).
cnf(c_0_23,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_9]) ).
cnf(c_0_24,plain,
multiply(inverse(a3),multiply(X1,multiply(a3,X2))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_19]),c_0_14]),c_0_20]),c_0_21]) ).
cnf(c_0_25,negated_conjecture,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_26,plain,
multiply(a3,multiply(X1,X2)) = multiply(X1,multiply(a3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP511-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 00:16:50 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.63 % Version : CSE_E---1.5
% 0.20/0.63 % Problem : theBenchmark.p
% 0.20/0.63 % Proof found
% 0.20/0.63 % SZS status Theorem for theBenchmark.p
% 0.20/0.63 % SZS output start Proof
% See solution above
% 0.20/0.64 % Total time : 0.051000 s
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time : 0.054000 s
%------------------------------------------------------------------------------