TSTP Solution File: GRP450-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP450-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 : n027.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:21 EDT 2023
% Result : Unsatisfiable 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 39 ( 33 unt; 6 typ; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 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 : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
divide: ( $i * $i ) > $i ).
tff(decl_23,type,
multiply: ( $i * $i ) > $i ).
tff(decl_24,type,
inverse: $i > $i ).
tff(decl_25,type,
a3: $i ).
tff(decl_26,type,
b3: $i ).
tff(decl_27,type,
c3: $i ).
cnf(inverse,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(single_axiom,axiom,
divide(X1,divide(divide(divide(divide(X2,X2),X2),X3),divide(divide(divide(X2,X2),X1),X3))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_0_4,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
inverse ).
cnf(c_0_5,axiom,
divide(X1,divide(divide(divide(divide(X2,X2),X2),X3),divide(divide(divide(X2,X2),X1),X3))) = X2,
single_axiom ).
cnf(c_0_6,plain,
divide(inverse(divide(X1,X1)),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_7,plain,
divide(X1,divide(divide(inverse(X2),X3),divide(inverse(X1),X3))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_4]),c_0_4]) ).
cnf(c_0_8,plain,
divide(inverse(inverse(divide(X1,X1))),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_9,plain,
divide(inverse(inverse(inverse(divide(X1,X1)))),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_10,plain,
divide(X1,inverse(divide(inverse(X1),inverse(X2)))) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_11,plain,
inverse(divide(divide(inverse(X1),X2),inverse(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_7]),c_0_9]) ).
cnf(c_0_12,plain,
divide(inverse(inverse(X1)),inverse(X2)) = divide(X1,inverse(X2)),
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_13,plain,
inverse(inverse(inverse(inverse(X1)))) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_4]) ).
cnf(c_0_14,plain,
divide(inverse(inverse(X1)),X2) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
divide(X1,divide(X2,divide(inverse(X1),divide(divide(inverse(X2),X3),divide(X4,X3))))) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_7]),c_0_14]) ).
cnf(c_0_16,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_15]) ).
cnf(c_0_17,plain,
divide(X1,divide(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_7]),c_0_16]) ).
cnf(c_0_18,plain,
divide(X1,divide(X2,inverse(X1))) = inverse(X2),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_19,plain,
divide(inverse(X1),divide(X2,X1)) = inverse(X2),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_20,plain,
divide(inverse(divide(X1,X2)),inverse(X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_19]),c_0_16]) ).
cnf(c_0_21,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
multiply ).
cnf(c_0_22,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_20]),c_0_16]) ).
cnf(c_0_23,plain,
divide(inverse(X1),divide(divide(inverse(X2),X3),divide(X1,X3))) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
prove_these_axioms_3 ).
cnf(c_0_25,plain,
multiply(X1,X2) = divide(X1,inverse(X2)),
inference(rw,[status(thm)],[c_0_21,c_0_4]) ).
cnf(c_0_26,plain,
divide(divide(X1,inverse(X2)),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_18]),c_0_16]) ).
cnf(c_0_27,plain,
divide(divide(divide(X1,X2),divide(inverse(X3),X2)),X3) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_23]),c_0_22]),c_0_16]) ).
cnf(c_0_28,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]),c_0_25]),c_0_25]) ).
cnf(c_0_29,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(X1,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_16]) ).
cnf(c_0_30,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference(rw,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_31,plain,
divide(divide(X1,X2),X3) = divide(X1,divide(X3,inverse(X2))),
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP450-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 00:36:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.59 % Total time : 0.011000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.014000 s
%------------------------------------------------------------------------------