TSTP Solution File: GRP698-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP698-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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 : 600s
% DateTime : Sat Jul 16 11:49:01 EDT 2022
% Result : Unsatisfiable 23.22s 23.39s
% Output : Refutation 23.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 17 RR)
% Number of literals : 17 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(mult(u,ld(u,v)),v),
file('GRP698-1.p',unknown),
[] ).
cnf(2,axiom,
equal(ld(u,mult(u,v)),v),
file('GRP698-1.p',unknown),
[] ).
cnf(3,axiom,
equal(mult(rd(u,v),v),u),
file('GRP698-1.p',unknown),
[] ).
cnf(5,axiom,
equal(mult(u,unit),u),
file('GRP698-1.p',unknown),
[] ).
cnf(7,axiom,
equal(mult(mult(mult(u,v),u),mult(u,w)),mult(u,mult(mult(mult(v,u),u),w))),
file('GRP698-1.p',unknown),
[] ).
cnf(9,axiom,
~ equal(mult(rd(mult(a,b),a),mult(a,c)),mult(a,mult(b,c))),
file('GRP698-1.p',unknown),
[] ).
cnf(60,plain,
equal(mult(u,mult(mult(mult(v,u),u),unit)),mult(mult(mult(u,v),u),u)),
inference(spr,[status(thm),theory(equality)],[5,7]),
[iquote('0:SpR:5.0,7.0')] ).
cnf(65,plain,
equal(mult(u,mult(mult(mult(ld(u,v),u),u),w)),mult(mult(v,u),mult(u,w))),
inference(spr,[status(thm),theory(equality)],[1,7]),
[iquote('0:SpR:1.0,7.0')] ).
cnf(69,plain,
equal(mult(mult(mult(u,v),u),u),mult(u,mult(mult(v,u),u))),
inference(rew,[status(thm),theory(equality)],[5,60]),
[iquote('0:Rew:5.0,60.0')] ).
cnf(110,plain,
equal(mult(u,mult(mult(ld(u,v),u),u)),mult(mult(v,u),u)),
inference(spr,[status(thm),theory(equality)],[1,69]),
[iquote('0:SpR:1.0,69.0')] ).
cnf(467,plain,
equal(mult(mult(ld(u,v),u),u),ld(u,mult(mult(v,u),u))),
inference(spr,[status(thm),theory(equality)],[110,2]),
[iquote('0:SpR:110.0,2.0')] ).
cnf(491,plain,
equal(mult(u,mult(ld(u,mult(mult(v,u),u)),w)),mult(mult(v,u),mult(u,w))),
inference(rew,[status(thm),theory(equality)],[467,65]),
[iquote('0:Rew:467.0,65.0')] ).
cnf(1990,plain,
equal(mult(u,mult(ld(u,mult(v,u)),w)),mult(v,mult(u,w))),
inference(spr,[status(thm),theory(equality)],[3,491]),
[iquote('0:SpR:3.0,491.0')] ).
cnf(10701,plain,
equal(mult(rd(u,v),mult(v,w)),mult(v,mult(ld(v,u),w))),
inference(spr,[status(thm),theory(equality)],[3,1990]),
[iquote('0:SpR:3.0,1990.0')] ).
cnf(10772,plain,
~ equal(mult(a,mult(ld(a,mult(a,b)),c)),mult(a,mult(b,c))),
inference(rew,[status(thm),theory(equality)],[10701,9]),
[iquote('0:Rew:10701.0,9.0')] ).
cnf(10830,plain,
~ equal(mult(a,mult(b,c)),mult(a,mult(b,c))),
inference(rew,[status(thm),theory(equality)],[2,10772]),
[iquote('0:Rew:2.0,10772.0')] ).
cnf(10831,plain,
$false,
inference(obv,[status(thm),theory(equality)],[10830]),
[iquote('0:Obv:10830.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP698-1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n026.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 : 600
% 0.12/0.33 % DateTime : Tue Jun 14 09:52:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 23.22/23.39
% 23.22/23.39 SPASS V 3.9
% 23.22/23.39 SPASS beiseite: Proof found.
% 23.22/23.39 % SZS status Theorem
% 23.22/23.39 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 23.22/23.39 SPASS derived 6220 clauses, backtracked 0 clauses, performed 0 splits and kept 2663 clauses.
% 23.22/23.39 SPASS allocated 120247 KBytes.
% 23.22/23.39 SPASS spent 0:0:22.74 on the problem.
% 23.22/23.39 0:00:00.03 for the input.
% 23.22/23.39 0:00:00.00 for the FLOTTER CNF translation.
% 23.22/23.39 0:00:00.10 for inferences.
% 23.22/23.39 0:00:00.00 for the backtracking.
% 23.22/23.39 0:0:22.58 for the reduction.
% 23.22/23.39
% 23.22/23.39
% 23.22/23.39 Here is a proof with depth 3, length 17 :
% 23.22/23.39 % SZS output start Refutation
% See solution above
% 23.22/23.39 Formulae used in the proof : c01 c02 c03 c05 c07 goals
% 23.22/23.39
%------------------------------------------------------------------------------