TSTP Solution File: GRP608-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP608-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n015.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:47 EDT 2023
% Result : Unsatisfiable 0.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 26 unt; 5 typ; 0 def)
% Number of atoms : 26 ( 25 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 : 9 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
inverse: $i > $i ).
tff(decl_23,type,
double_divide: ( $i * $i ) > $i ).
tff(decl_24,type,
multiply: ( $i * $i ) > $i ).
tff(decl_25,type,
a: $i ).
tff(decl_26,type,
b: $i ).
cnf(single_axiom,axiom,
double_divide(inverse(double_divide(X1,inverse(double_divide(inverse(X2),double_divide(X1,X3))))),X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_4) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
double_divide(inverse(double_divide(X1,inverse(double_divide(inverse(X2),double_divide(X1,X3))))),X3) = X2,
single_axiom ).
cnf(c_0_4,plain,
double_divide(inverse(double_divide(inverse(double_divide(X1,inverse(double_divide(inverse(X2),double_divide(X1,X3))))),inverse(double_divide(inverse(X4),X2)))),X3) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
double_divide(inverse(X1),inverse(double_divide(inverse(X2),X1))) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_6,plain,
double_divide(inverse(inverse(double_divide(inverse(X1),X2))),inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_7,plain,
double_divide(inverse(inverse(X1)),inverse(X2)) = inverse(double_divide(inverse(X1),X2)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
inverse(double_divide(inverse(double_divide(inverse(X1),X2)),X1)) = X2,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
inverse(double_divide(X1,double_divide(inverse(X2),X1))) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(inverse(X1),inverse(X2)) = inverse(double_divide(X1,X2)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
inverse(double_divide(double_divide(inverse(X1),X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_9]),c_0_10]) ).
cnf(c_0_12,plain,
double_divide(inverse(X1),double_divide(inverse(X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_13,plain,
inverse(double_divide(inverse(X1),X1)) = double_divide(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_14,plain,
double_divide(X1,inverse(double_divide(inverse(X2),double_divide(X1,double_divide(X3,X4))))) = double_divide(inverse(double_divide(X3,inverse(X2))),X4),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_15,plain,
double_divide(double_divide(inverse(X1),X1),inverse(X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_13]),c_0_11]) ).
cnf(c_0_16,plain,
double_divide(inverse(inverse(double_divide(X1,X2))),X1) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_10]),c_0_9]),c_0_10]) ).
cnf(c_0_17,plain,
inverse(double_divide(double_divide(inverse(X1),X2),X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_15]),c_0_15]),c_0_10]) ).
cnf(c_0_18,plain,
double_divide(inverse(X1),double_divide(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
multiply(a,b) != multiply(b,a),
prove_these_axioms_4 ).
cnf(c_0_20,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_21,plain,
inverse(double_divide(inverse(X1),X2)) = double_divide(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
cnf(c_0_22,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
inverse(double_divide(b,a)) != inverse(double_divide(a,b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
cnf(c_0_24,plain,
double_divide(X1,X2) = double_divide(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_10]),c_0_22]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP608-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 28 21:14:55 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.54 start to proof: theBenchmark
% 0.19/0.56 % Version : CSE_E---1.5
% 0.19/0.56 % Problem : theBenchmark.p
% 0.19/0.56 % Proof found
% 0.19/0.56 % SZS status Theorem for theBenchmark.p
% 0.19/0.56 % SZS output start Proof
% See solution above
% 0.19/0.57 % Total time : 0.018000 s
% 0.19/0.57 % SZS output end Proof
% 0.19/0.57 % Total time : 0.021000 s
%------------------------------------------------------------------------------