TSTP Solution File: GRP117-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP117-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n013.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:16:07 EDT 2023
% Result : Unsatisfiable 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 11 unt; 3 typ; 0 def)
% Number of atoms : 11 ( 10 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 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 : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
multiply: ( $i * $i ) > $i ).
tff(decl_23,type,
identity: $i ).
tff(decl_24,type,
a: $i ).
cnf(single_axiom,axiom,
multiply(X1,multiply(multiply(X1,multiply(multiply(X1,X2),X3)),multiply(identity,multiply(X3,X3)))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_order3,negated_conjecture,
multiply(a,identity) != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_order3) ).
cnf(c_0_2,axiom,
multiply(X1,multiply(multiply(X1,multiply(multiply(X1,X2),X3)),multiply(identity,multiply(X3,X3)))) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,multiply(multiply(X1,multiply(multiply(X1,X2),multiply(identity,multiply(multiply(identity,X3),multiply(identity,X3))))),X3)) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(multiply(X1,X2),multiply(identity,X3)) = multiply(X1,multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
multiply(X1,multiply(X1,multiply(multiply(multiply(X1,X2),X3),multiply(X3,X3)))) = X2,
inference(rw,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_6,plain,
multiply(X1,multiply(X1,multiply(X1,multiply(multiply(X2,X3),multiply(X3,X3))))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_4]),c_0_4]),c_0_4]) ).
cnf(c_0_7,plain,
multiply(multiply(X1,multiply(X2,X2)),X2) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
multiply(a,identity) != a,
prove_order3 ).
cnf(c_0_9,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_7]),c_0_4]),c_0_7]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP117-1 : TPTP v8.1.2. Released v1.2.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 28 22:48:31 EDT 2023
% 0.12/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.005000 s
% 0.20/0.59 % SZS output end Proof
% 0.20/0.59 % Total time : 0.007000 s
%------------------------------------------------------------------------------