TSTP Solution File: GRP497-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP497-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 : n014.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:33 EDT 2023
% Result : Unsatisfiable 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 32 ( 27 unt; 5 typ; 0 def)
% Number of atoms : 27 ( 26 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
identity: $i ).
tff(decl_23,type,
double_divide: ( $i * $i ) > $i ).
tff(decl_24,type,
multiply: ( $i * $i ) > $i ).
tff(decl_25,type,
inverse: $i > $i ).
tff(decl_26,type,
a2: $i ).
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(single_axiom,axiom,
double_divide(double_divide(identity,double_divide(X1,double_divide(X2,identity))),double_divide(double_divide(X2,double_divide(X3,X1)),identity)) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_5,axiom,
identity = double_divide(X1,inverse(X1)),
identity ).
cnf(c_0_6,axiom,
inverse(X1) = double_divide(X1,identity),
inverse ).
cnf(c_0_7,plain,
identity = double_divide(X1,double_divide(X1,identity)),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
double_divide(double_divide(identity,double_divide(X1,double_divide(X2,identity))),double_divide(double_divide(X2,double_divide(X3,X1)),identity)) = X3,
single_axiom ).
cnf(c_0_9,plain,
double_divide(identity,identity) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(double_divide(identity,double_divide(identity,double_divide(X1,identity))),identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_7]),c_0_9]) ).
cnf(c_0_11,plain,
double_divide(double_divide(identity,double_divide(identity,double_divide(X1,identity))),X1) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_12,plain,
double_divide(double_divide(identity,double_divide(X1,double_divide(X2,X1))),identity) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_11]),c_0_10]),c_0_9]) ).
cnf(c_0_13,plain,
double_divide(double_divide(identity,double_divide(double_divide(X1,X2),identity)),X1) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_12]),c_0_9]) ).
cnf(c_0_14,plain,
double_divide(double_divide(identity,double_divide(double_divide(double_divide(X1,double_divide(X2,X3)),identity),double_divide(X4,identity))),double_divide(double_divide(X4,X2),identity)) = double_divide(identity,double_divide(X3,double_divide(X1,identity))),
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_15,plain,
double_divide(identity,X1) = double_divide(X1,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_7]),c_0_9]),c_0_9]) ).
cnf(c_0_16,plain,
double_divide(double_divide(identity,double_divide(double_divide(identity,double_divide(X1,double_divide(X2,X3))),double_divide(X4,identity))),double_divide(identity,double_divide(X4,X2))) = double_divide(identity,double_divide(X3,double_divide(X1,identity))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_17,plain,
double_divide(double_divide(identity,double_divide(identity,double_divide(X1,X2))),X1) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_18,plain,
double_divide(identity,double_divide(X1,double_divide(X2,identity))) = double_divide(X2,double_divide(identity,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_9]),c_0_9]),c_0_9]),c_0_13]) ).
cnf(c_0_19,negated_conjecture,
multiply(identity,a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_20,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_21,plain,
double_divide(double_divide(X1,identity),X1) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_9]) ).
cnf(c_0_22,negated_conjecture,
double_divide(double_divide(a2,identity),identity) != a2,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
double_divide(double_divide(identity,X1),X1) = identity,
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_24,negated_conjecture,
double_divide(identity,double_divide(identity,a2)) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_15]),c_0_15]) ).
cnf(c_0_25,plain,
double_divide(identity,double_divide(identity,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_9]),c_0_9]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP497-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.16/0.34 % Computer : n014.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Aug 29 01:20:00 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.59 % Version : CSE_E---1.5
% 0.20/0.59 % Problem : theBenchmark.p
% 0.20/0.59 % Proof found
% 0.20/0.59 % SZS status Theorem for theBenchmark.p
% 0.20/0.59 % SZS output start Proof
% See solution above
% 0.20/0.59 % Total time : 0.009000 s
% 0.20/0.59 % SZS output end Proof
% 0.20/0.59 % Total time : 0.011000 s
%------------------------------------------------------------------------------