TSTP Solution File: ALG245-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : ALG245-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n009.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 : Wed Aug 30 16:07:08 EDT 2023
% Result : Unsatisfiable 111.80s 112.12s
% Output : CNFRefutation 111.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 22 ( 17 unt; 5 typ; 0 def)
% Number of atoms : 17 ( 16 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 : 6 ( 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
mult: ( $i * $i ) > $i ).
tff(decl_23,type,
a: $i ).
tff(decl_24,type,
b: $i ).
tff(decl_25,type,
c: $i ).
tff(decl_26,type,
d: $i ).
cnf(c02,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c03,axiom,
mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4)))) = mult(mult(X1,X3),mult(X2,X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).
cnf(c01,axiom,
mult(X1,mult(X2,X3)) = mult(mult(X1,X2),mult(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
cnf(c05,axiom,
mult(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
cnf(c04,axiom,
mult(mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4))),mult(mult(X1,X3),mult(X2,X4))) = mult(mult(X1,X2),mult(X3,X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).
cnf(goals,negated_conjecture,
mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d))) != mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_0_6,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,X3)),
c02 ).
cnf(c_0_7,axiom,
mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4)))) = mult(mult(X1,X3),mult(X2,X4)),
c03 ).
cnf(c_0_8,axiom,
mult(X1,mult(X2,X3)) = mult(mult(X1,X2),mult(X1,X3)),
c01 ).
cnf(c_0_9,axiom,
mult(X1,X1) = X1,
c05 ).
cnf(c_0_10,plain,
mult(mult(mult(X1,X2),mult(X3,X4)),mult(X5,mult(mult(mult(X1,X3),mult(X2,X4)),mult(mult(X1,X2),mult(X3,X4))))) = mult(mult(mult(X1,X3),mult(X2,X4)),mult(X5,mult(mult(X1,X2),mult(X3,X4)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_11,axiom,
mult(mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4))),mult(mult(X1,X3),mult(X2,X4))) = mult(mult(X1,X2),mult(X3,X4)),
c04 ).
cnf(c_0_12,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(mult(X1,X3),mult(X2,X4)),mult(mult(X1,X2),mult(X3,X4)))) = mult(mult(X1,X3),mult(X2,X4)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_11]),c_0_9]) ).
cnf(c_0_14,negated_conjecture,
mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d))) != mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))),
goals ).
cnf(c_0_15,plain,
mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4))) = mult(mult(mult(X1,X3),mult(X2,X4)),mult(mult(X1,X2),mult(X3,X4))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_11]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG245-1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n009.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 03:41:35 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.52/0.59 start to proof: theBenchmark
% 111.80/112.12 % Version : CSE_E---1.5
% 111.80/112.12 % Problem : theBenchmark.p
% 111.80/112.12 % Proof found
% 111.80/112.12 % SZS status Theorem for theBenchmark.p
% 111.80/112.12 % SZS output start Proof
% See solution above
% 111.80/112.12 % Total time : 111.326000 s
% 111.80/112.12 % SZS output end Proof
% 111.80/112.12 % Total time : 111.334000 s
%------------------------------------------------------------------------------