TSTP Solution File: GRP559-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP559-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 : n032.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:35 EDT 2023
% Result : Unsatisfiable 0.16s 0.61s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 46 ( 40 unt; 6 typ; 0 def)
% Number of atoms : 40 ( 39 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 8 ( 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 : 76 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
divide: ( $i * $i ) > $i ).
tff(decl_23,type,
inverse: $i > $i ).
tff(decl_24,type,
multiply: ( $i * $i ) > $i ).
tff(decl_25,type,
a3: $i ).
tff(decl_26,type,
b3: $i ).
tff(decl_27,type,
c3: $i ).
cnf(single_axiom,axiom,
divide(X1,inverse(divide(divide(X2,X3),divide(X1,X3)))) = X2,
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
divide(X1,inverse(divide(divide(X2,X3),divide(X1,X3)))) = X2,
single_axiom ).
cnf(c_0_4,plain,
divide(X1,inverse(divide(X2,divide(X1,inverse(divide(divide(X2,X3),divide(X4,X3))))))) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
divide(X1,inverse(divide(X2,X2))) = X1,
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_6,plain,
divide(X1,inverse(divide(X2,X1))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_5]),c_0_5]) ).
cnf(c_0_7,plain,
divide(inverse(divide(X1,X2)),inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_8,plain,
divide(inverse(X1),inverse(X2)) = inverse(divide(X1,X2)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
inverse(divide(divide(X1,X2),X1)) = X2,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
inverse(divide(X1,divide(X2,X2))) = inverse(X1),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_11,plain,
inverse(divide(divide(X1,X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
divide(X1,divide(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_11]) ).
cnf(c_0_13,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_14,plain,
divide(X1,inverse(inverse(divide(X2,X2)))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_15,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
prove_these_axioms_3 ).
cnf(c_0_16,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_17,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_13]),c_0_13]) ).
cnf(c_0_18,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_15,c_0_16]),c_0_16]),c_0_16]),c_0_16]) ).
cnf(c_0_19,plain,
divide(inverse(X1),inverse(X2)) = divide(X2,X1),
inference(rw,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_20,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_17]),c_0_17]) ).
cnf(c_0_21,plain,
divide(X1,inverse(divide(divide(X2,inverse(divide(divide(X3,X4),divide(X1,X4)))),X3))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_22,plain,
divide(X1,divide(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_23,plain,
divide(divide(X1,X2),X1) = inverse(X2),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_24,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference(rw,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_25,plain,
divide(inverse(X1),X2) = divide(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
divide(X1,divide(X2,divide(X3,divide(divide(X1,X4),divide(X2,X4))))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_13]),c_0_13]) ).
cnf(c_0_27,plain,
divide(X1,X1) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_12,c_0_22]) ).
cnf(c_0_28,plain,
divide(divide(X1,X2),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
divide(X1,inverse(X2)) = divide(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_31,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_22]) ).
cnf(c_0_32,plain,
divide(divide(X1,X2),inverse(X3)) = divide(X3,divide(X2,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_33,plain,
divide(divide(X1,inverse(X2)),X2) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_20]) ).
cnf(c_0_34,negated_conjecture,
divide(c3,divide(inverse(a3),b3)) != divide(a3,divide(inverse(b3),c3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_13]),c_0_25]) ).
cnf(c_0_35,plain,
divide(X1,divide(X2,X3)) = divide(X3,divide(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_23]),c_0_32]) ).
cnf(c_0_36,plain,
divide(divide(X1,inverse(X2)),X3) = divide(X1,divide(X3,X2)),
inference(spm,[status(thm)],[c_0_31,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
divide(b3,divide(inverse(a3),c3)) != divide(a3,divide(inverse(b3),c3)),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
divide(X1,divide(inverse(X2),X3)) = divide(X2,divide(inverse(X3),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_36]),c_0_13]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GRP559-1 : TPTP v8.1.2. Released v2.6.0.
% 0.05/0.11 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Aug 29 00:31:16 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.56 start to proof: theBenchmark
% 0.16/0.61 % Version : CSE_E---1.5
% 0.16/0.61 % Problem : theBenchmark.p
% 0.16/0.61 % Proof found
% 0.16/0.61 % SZS status Theorem for theBenchmark.p
% 0.16/0.61 % SZS output start Proof
% See solution above
% 0.16/0.61 % Total time : 0.040000 s
% 0.16/0.61 % SZS output end Proof
% 0.16/0.61 % Total time : 0.042000 s
%------------------------------------------------------------------------------