TSTP Solution File: GRP715-11 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRP715-11 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n004.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:23:19 EDT 2023
% Result : Unsatisfiable 0.88s 0.93s
% Output : CNFRefutation 0.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 31 ( 23 unt; 8 typ; 0 def)
% Number of atoms : 23 ( 22 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 : 5 ( 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
plus: ( $i * $i ) > $i ).
tff(decl_23,type,
op_0: $i ).
tff(decl_24,type,
minus: $i > $i ).
tff(decl_25,type,
mult: ( $i * $i ) > $i ).
tff(decl_26,type,
unit: $i ).
tff(decl_27,type,
op_a: $i ).
tff(decl_28,type,
op_b: $i ).
tff(decl_29,type,
x0: $i ).
cnf(f07,axiom,
mult(X1,mult(X2,X2)) = mult(mult(X1,X2),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).
cnf(f06,axiom,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
cnf(f11,axiom,
mult(op_b,op_a) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).
cnf(f09,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
cnf(f10,axiom,
mult(op_a,op_b) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f10) ).
cnf(f08,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
cnf(goal,negated_conjecture,
mult(mult(x0,op_b),op_a) != x0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(c_0_7,axiom,
mult(X1,mult(X2,X2)) = mult(mult(X1,X2),X2),
f07 ).
cnf(c_0_8,axiom,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
f06 ).
cnf(c_0_9,plain,
mult(mult(X1,mult(mult(X2,X3),X2)),X2) = mult(mult(mult(X1,X2),X3),mult(X2,X2)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
mult(op_b,op_a) = unit,
f11 ).
cnf(c_0_11,axiom,
mult(unit,X1) = X1,
f09 ).
cnf(c_0_12,axiom,
mult(op_a,op_b) = unit,
f10 ).
cnf(c_0_13,plain,
mult(mult(mult(X1,op_b),op_a),mult(op_b,op_b)) = mult(X1,mult(op_b,op_b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_7]) ).
cnf(c_0_14,plain,
mult(op_a,mult(op_b,op_b)) = op_b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_11]) ).
cnf(c_0_15,axiom,
mult(X1,unit) = X1,
f08 ).
cnf(c_0_16,plain,
mult(mult(mult(X1,mult(X2,X2)),X3),X2) = mult(mult(X1,X2),mult(mult(X2,X3),X2)),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_17,plain,
mult(mult(X1,mult(op_b,op_b)),op_a) = mult(X1,op_b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_13]),c_0_14]),c_0_10]),c_0_15]) ).
cnf(c_0_18,plain,
mult(mult(X1,mult(op_a,op_a)),op_b) = mult(X1,op_a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_14]),c_0_10]),c_0_15]) ).
cnf(c_0_19,plain,
mult(op_b,mult(op_a,op_a)) = op_a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_10]),c_0_11]) ).
cnf(c_0_20,negated_conjecture,
mult(mult(x0,op_b),op_a) != x0,
goal ).
cnf(c_0_21,plain,
mult(mult(X1,op_b),op_a) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_18]),c_0_19]),c_0_12]),c_0_15]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP715-11 : TPTP v8.1.2. Released v8.1.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n004.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 : Tue Aug 29 02:34:07 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.54 start to proof: theBenchmark
% 0.88/0.93 % Version : CSE_E---1.5
% 0.88/0.93 % Problem : theBenchmark.p
% 0.88/0.93 % Proof found
% 0.88/0.93 % SZS status Theorem for theBenchmark.p
% 0.88/0.93 % SZS output start Proof
% See solution above
% 0.88/0.93 % Total time : 0.374000 s
% 0.88/0.93 % SZS output end Proof
% 0.88/0.93 % Total time : 0.377000 s
%------------------------------------------------------------------------------