TSTP Solution File: GEO637+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO637+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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 06:25:39 EDT 2022
% Result : Theorem 9.91s 10.13s
% Output : Refutation 9.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of clauses : 35 ( 12 unt; 2 nHn; 35 RR)
% Number of literals : 64 ( 0 equ; 28 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-8 aty)
% Number of functors : 15 ( 15 usr; 15 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
midp(skc8,skc11,skc12),
file('GEO637+1.p',unknown),
[] ).
cnf(7,axiom,
~ cyclic(skc13,skc7,skc10,skc9),
file('GEO637+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ midp(u,v,w)
| midp(u,w,v) ),
file('GEO637+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ para(u,v,w,x)
| para(u,v,x,w) ),
file('GEO637+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ para(u,v,w,x)
| para(w,x,u,v) ),
file('GEO637+1.p',unknown),
[] ).
cnf(32,axiom,
( ~ eqangle(u,v,w,x,y,z,w,x)
| para(u,v,y,z) ),
file('GEO637+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ para(u,v,w,x)
| eqangle(u,v,y,z,w,x,y,z) ),
file('GEO637+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ cyclic(u,v,w,x)
| eqangle(w,u,w,v,x,u,x,v) ),
file('GEO637+1.p',unknown),
[] ).
cnf(37,axiom,
( ~ midp(u,v,w)
| ~ midp(u,x,y)
| para(x,v,y,w) ),
file('GEO637+1.p',unknown),
[] ).
cnf(46,axiom,
( ~ cyclic(u,v,w,x)
| ~ cyclic(u,v,w,y)
| cyclic(v,w,y,x) ),
file('GEO637+1.p',unknown),
[] ).
cnf(54,axiom,
( ~ eqangle(u,v,w,x,y,z,x1,x2)
| eqangle(w,x,u,v,x1,x2,y,z) ),
file('GEO637+1.p',unknown),
[] ).
cnf(56,axiom,
( ~ eqangle(u,v,w,x,y,z,x1,x2)
| eqangle(u,v,y,z,w,x,x1,x2) ),
file('GEO637+1.p',unknown),
[] ).
cnf(61,axiom,
( ~ eqangle(u,v,u,w,x,v,x,w)
| coll(u,x,v)
| cyclic(v,w,u,x) ),
file('GEO637+1.p',unknown),
[] ).
cnf(78,axiom,
( ~ coll(u,v,w)
| ~ eqangle(u,x,u,w,v,x,v,w)
| cyclic(x,w,u,v) ),
file('GEO637+1.p',unknown),
[] ).
cnf(159,plain,
midp(skc8,skc12,skc11),
inference(res,[status(thm),theory(equality)],[2,10]),
[iquote('0:Res:2.0,10.0')] ).
cnf(161,plain,
( ~ midp(skc8,u,v)
| para(u,skc11,v,skc12) ),
inference(res,[status(thm),theory(equality)],[2,37]),
[iquote('0:Res:2.0,37.1')] ).
cnf(611,plain,
( ~ cyclic(u,v,w,w)
| para(w,u,w,u) ),
inference(res,[status(thm),theory(equality)],[34,32]),
[iquote('0:Res:34.1,32.0')] ).
cnf(1365,plain,
( ~ para(u,v,w,x)
| eqangle(u,v,w,x,y,z,y,z) ),
inference(res,[status(thm),theory(equality)],[33,56]),
[iquote('0:Res:33.1,56.0')] ).
cnf(1397,plain,
( ~ para(u,v,w,x)
| eqangle(y,z,u,v,y,z,w,x) ),
inference(res,[status(thm),theory(equality)],[33,54]),
[iquote('0:Res:33.1,54.0')] ).
cnf(3437,plain,
( ~ midp(skc8,u,v)
| para(u,skc11,skc12,v) ),
inference(res,[status(thm),theory(equality)],[161,14]),
[iquote('0:Res:161.1,14.0')] ).
cnf(4520,plain,
( ~ para(u,v,u,v)
| coll(u,w,v)
| cyclic(v,v,u,w) ),
inference(res,[status(thm),theory(equality)],[1365,61]),
[iquote('0:Res:1365.1,61.0')] ).
cnf(4531,plain,
( ~ para(u,v,u,v)
| ~ coll(u,w,v)
| cyclic(v,v,u,w) ),
inference(res,[status(thm),theory(equality)],[1365,78]),
[iquote('0:Res:1365.1,78.1')] ).
cnf(4545,plain,
( ~ para(u,v,u,v)
| cyclic(v,v,u,w) ),
inference(mrr,[status(thm)],[4531,4520]),
[iquote('0:MRR:4531.1,4520.1')] ).
cnf(4784,plain,
( ~ para(u,v,u,v)
| para(w,x,w,x) ),
inference(res,[status(thm),theory(equality)],[1397,32]),
[iquote('0:Res:1397.1,32.0')] ).
cnf(14767,plain,
( ~ midp(skc8,skc12,skc11)
| cyclic(skc11,skc11,skc12,u) ),
inference(res,[status(thm),theory(equality)],[3437,4545]),
[iquote('0:Res:3437.1,4545.0')] ).
cnf(14773,plain,
cyclic(skc11,skc11,skc12,u),
inference(mrr,[status(thm)],[14767,159]),
[iquote('0:MRR:14767.0,159.0')] ).
cnf(14802,plain,
para(skc12,skc11,skc12,skc11),
inference(res,[status(thm),theory(equality)],[14773,611]),
[iquote('0:Res:14773.0,611.0')] ).
cnf(14869,plain,
para(skc12,skc11,skc11,skc12),
inference(res,[status(thm),theory(equality)],[14802,14]),
[iquote('0:Res:14802.0,14.0')] ).
cnf(14942,plain,
para(skc11,skc12,skc12,skc11),
inference(res,[status(thm),theory(equality)],[14869,15]),
[iquote('0:Res:14869.0,15.0')] ).
cnf(15016,plain,
para(skc11,skc12,skc11,skc12),
inference(res,[status(thm),theory(equality)],[14942,14]),
[iquote('0:Res:14942.0,14.0')] ).
cnf(15536,plain,
para(u,v,u,v),
inference(res,[status(thm),theory(equality)],[15016,4784]),
[iquote('0:Res:15016.0,4784.0')] ).
cnf(15543,plain,
cyclic(u,u,v,w),
inference(mrr,[status(thm)],[4545,15536]),
[iquote('0:MRR:4545.0,15536.0')] ).
cnf(17229,plain,
( ~ cyclic(u,u,v,w)
| cyclic(u,v,w,x) ),
inference(res,[status(thm),theory(equality)],[15543,46]),
[iquote('0:Res:15543.0,46.0')] ).
cnf(17318,plain,
cyclic(u,v,w,x),
inference(mrr,[status(thm)],[17229,15543]),
[iquote('0:MRR:17229.0,15543.0')] ).
cnf(17319,plain,
$false,
inference(unc,[status(thm)],[17318,7]),
[iquote('0:UnC:17318.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GEO637+1 : TPTP v8.1.0. Released v7.5.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n007.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 : 600
% 0.12/0.34 % DateTime : Sat Jun 18 16:06:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 9.91/10.13
% 9.91/10.13 SPASS V 3.9
% 9.91/10.13 SPASS beiseite: Proof found.
% 9.91/10.13 % SZS status Theorem
% 9.91/10.13 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.91/10.13 SPASS derived 16639 clauses, backtracked 0 clauses, performed 4 splits and kept 10102 clauses.
% 9.91/10.13 SPASS allocated 98338 KBytes.
% 9.91/10.13 SPASS spent 0:00:09.55 on the problem.
% 9.91/10.13 0:00:00.04 for the input.
% 9.91/10.13 0:00:00.23 for the FLOTTER CNF translation.
% 9.91/10.13 0:00:00.41 for inferences.
% 9.91/10.13 0:00:00.04 for the backtracking.
% 9.91/10.13 0:00:08.42 for the reduction.
% 9.91/10.13
% 9.91/10.13
% 9.91/10.13 Here is a proof with depth 8, length 35 :
% 9.91/10.13 % SZS output start Refutation
% See solution above
% 9.91/10.13 Formulae used in the proof : exemplo6GDDFULL81109101 ruleD11 ruleD4 ruleD5 ruleD39 ruleD40 ruleD41 ruleD63 ruleD17 ruleD19 ruleD21 ruleD42a ruleD42b
% 9.91/10.13
%------------------------------------------------------------------------------