TSTP Solution File: GRP657+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP657+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:48:44 EDT 2022
% Result : Theorem 0.21s 0.47s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 12 unt; 0 nHn; 14 RR)
% Number of literals : 16 ( 0 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
equal(ld(u,mult(u,v)),v),
file('GRP657+1.p',unknown),
[] ).
cnf(3,axiom,
equal(mult(rd(u,v),v),u),
file('GRP657+1.p',unknown),
[] ).
cnf(4,axiom,
equal(rd(mult(u,v),v),u),
file('GRP657+1.p',unknown),
[] ).
cnf(5,axiom,
equal(mult(mult(u,v),mult(w,u)),mult(u,mult(mult(v,w),u))),
file('GRP657+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ equal(mult(u,skf3(u)),skf3(u))
| ~ equal(mult(skf2(u),u),skf2(u)) ),
file('GRP657+1.p',unknown),
[] ).
cnf(17,plain,
equal(rd(mult(u,mult(mult(v,w),u)),mult(w,u)),mult(u,v)),
inference(spr,[status(thm),theory(equality)],[5,4]),
[iquote('0:SpR:5.0,4.0')] ).
cnf(40,plain,
equal(rd(mult(u,mult(v,u)),mult(w,u)),mult(u,rd(v,w))),
inference(spr,[status(thm),theory(equality)],[3,17]),
[iquote('0:SpR:3.0,17.0')] ).
cnf(101,plain,
equal(mult(u,rd(v,v)),u),
inference(spr,[status(thm),theory(equality)],[40,4]),
[iquote('0:SpR:40.0,4.0')] ).
cnf(133,plain,
equal(ld(u,u),rd(v,v)),
inference(spr,[status(thm),theory(equality)],[101,2]),
[iquote('0:SpR:101.0,2.0')] ).
cnf(138,plain,
( ~ equal(mult(rd(u,u),skf3(rd(u,u))),skf3(rd(u,u)))
| ~ equal(skf2(rd(u,u)),skf2(rd(u,u))) ),
inference(spl,[status(thm),theory(equality)],[101,6]),
[iquote('0:SpL:101.0,6.1')] ).
cnf(141,plain,
~ equal(mult(rd(u,u),skf3(rd(u,u))),skf3(rd(u,u))),
inference(obv,[status(thm),theory(equality)],[138]),
[iquote('0:Obv:138.1')] ).
cnf(167,plain,
equal(rd(u,u),rd(v,v)),
inference(spr,[status(thm),theory(equality)],[133]),
[iquote('0:SpR:133.0,133.0')] ).
cnf(175,plain,
equal(mult(rd(u,u),v),v),
inference(spr,[status(thm),theory(equality)],[167,3]),
[iquote('0:SpR:167.0,3.0')] ).
cnf(191,plain,
$false,
inference(unc,[status(thm)],[175,141]),
[iquote('0:UnC:175.0,141.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP657+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : run_spass %d %s
% 0.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 15:57:38 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.47
% 0.21/0.47 SPASS V 3.9
% 0.21/0.47 SPASS beiseite: Proof found.
% 0.21/0.47 % SZS status Theorem
% 0.21/0.47 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 SPASS derived 143 clauses, backtracked 0 clauses, performed 0 splits and kept 60 clauses.
% 0.21/0.47 SPASS allocated 85400 KBytes.
% 0.21/0.47 SPASS spent 0:00:00.10 on the problem.
% 0.21/0.47 0:00:00.04 for the input.
% 0.21/0.47 0:00:00.02 for the FLOTTER CNF translation.
% 0.21/0.47 0:00:00.00 for inferences.
% 0.21/0.47 0:00:00.00 for the backtracking.
% 0.21/0.47 0:00:00.02 for the reduction.
% 0.21/0.47
% 0.21/0.47
% 0.21/0.47 Here is a proof with depth 6, length 14 :
% 0.21/0.47 % SZS output start Refutation
% See solution above
% 0.21/0.47 Formulae used in the proof : f02 f03 f04 f05 goals
% 0.21/0.47
%------------------------------------------------------------------------------