TSTP Solution File: GRP457-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP457-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 : n003.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:23 EDT 2023
% Result : Unsatisfiable 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of formulae : 15 ( 10 unt; 5 typ; 0 def)
% Number of atoms : 10 ( 9 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 : 3 ( 1 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 : 8 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
divide: ( $i * $i ) > $i ).
tff(decl_23,type,
identity: $i ).
tff(decl_24,type,
multiply: ( $i * $i ) > $i ).
tff(decl_25,type,
inverse: $i > $i ).
tff(decl_26,type,
a1: $i ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(inverse,axiom,
inverse(X1) = divide(identity,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(identity,axiom,
identity = divide(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
cnf(c_0_4,negated_conjecture,
multiply(inverse(a1),a1) != identity,
prove_these_axioms_1 ).
cnf(c_0_5,axiom,
inverse(X1) = divide(identity,X1),
inverse ).
cnf(c_0_6,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
multiply ).
cnf(c_0_7,negated_conjecture,
divide(divide(identity,a1),divide(identity,a1)) != identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_8,axiom,
identity = divide(X1,X1),
identity ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP457-1 : TPTP v8.1.2. Released v2.6.0.
% 0.03/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n003.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 20:18:10 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.19/0.57 % Version : CSE_E---1.5
% 0.19/0.57 % Problem : theBenchmark.p
% 0.19/0.57 % Proof found
% 0.19/0.57 % SZS status Theorem for theBenchmark.p
% 0.19/0.57 % SZS output start Proof
% See solution above
% 0.19/0.57 % Total time : 0.003000 s
% 0.19/0.57 % SZS output end Proof
% 0.19/0.57 % Total time : 0.005000 s
%------------------------------------------------------------------------------