TSTP Solution File: GEO601+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO601+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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:27 EDT 2022
% Result : Theorem 10.72s 10.92s
% Output : Refutation 10.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 29 ( 10 unt; 2 nHn; 29 RR)
% Number of literals : 54 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-8 aty)
% Number of functors : 15 ( 15 usr; 14 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
circle(skc13,skc7,skc11,skc8),
file('GEO601+1.p',unknown),
[] ).
cnf(5,axiom,
~ cyclic(skc11,skc12,skc13,skc10),
file('GEO601+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ perp(u,v,w,x)
| perp(w,x,u,v) ),
file('GEO601+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ cyclic(u,v,w,x)
| cyclic(v,u,w,x) ),
file('GEO601+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ circle(u,v,w,x)
| perp(skf31(u,v),v,v,u) ),
file('GEO601+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ eqangle(u,v,w,x,y,z,w,x)
| para(u,v,y,z) ),
file('GEO601+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ para(u,v,w,x)
| eqangle(u,v,y,z,w,x,y,z) ),
file('GEO601+1.p',unknown),
[] ).
cnf(41,axiom,
( ~ perp(u,v,w,x)
| ~ perp(y,z,u,v)
| para(y,z,w,x) ),
file('GEO601+1.p',unknown),
[] ).
cnf(44,axiom,
( ~ cyclic(u,v,w,x)
| ~ cyclic(u,v,w,y)
| cyclic(v,w,y,x) ),
file('GEO601+1.p',unknown),
[] ).
cnf(52,axiom,
( ~ eqangle(u,v,w,x,y,z,x1,x2)
| eqangle(w,x,u,v,x1,x2,y,z) ),
file('GEO601+1.p',unknown),
[] ).
cnf(54,axiom,
( ~ eqangle(u,v,w,x,y,z,x1,x2)
| eqangle(u,v,y,z,w,x,x1,x2) ),
file('GEO601+1.p',unknown),
[] ).
cnf(59,axiom,
( ~ eqangle(u,v,u,w,x,v,x,w)
| coll(u,x,v)
| cyclic(v,w,u,x) ),
file('GEO601+1.p',unknown),
[] ).
cnf(76,axiom,
( ~ coll(u,v,w)
| ~ eqangle(u,x,u,w,v,x,v,w)
| cyclic(x,w,u,v) ),
file('GEO601+1.p',unknown),
[] ).
cnf(167,plain,
perp(skf31(skc13,skc7),skc7,skc7,skc13),
inference(res,[status(thm),theory(equality)],[2,22]),
[iquote('0:Res:2.0,22.0')] ).
cnf(172,plain,
~ cyclic(skc12,skc11,skc13,skc10),
inference(res,[status(thm),theory(equality)],[18,5]),
[iquote('0:Res:18.1,5.0')] ).
cnf(220,plain,
perp(skc7,skc13,skf31(skc13,skc7),skc7),
inference(res,[status(thm),theory(equality)],[167,15]),
[iquote('0:Res:167.0,15.0')] ).
cnf(632,plain,
( ~ perp(u,v,skf31(skc13,skc7),skc7)
| para(u,v,skc7,skc13) ),
inference(res,[status(thm),theory(equality)],[167,41]),
[iquote('0:Res:167.0,41.0')] ).
cnf(777,plain,
para(skc7,skc13,skc7,skc13),
inference(res,[status(thm),theory(equality)],[220,632]),
[iquote('0:Res:220.0,632.0')] ).
cnf(1288,plain,
( ~ para(u,v,w,x)
| eqangle(u,v,w,x,y,z,y,z) ),
inference(res,[status(thm),theory(equality)],[31,54]),
[iquote('0:Res:31.1,54.0')] ).
cnf(1320,plain,
( ~ para(u,v,w,x)
| eqangle(y,z,u,v,y,z,w,x) ),
inference(res,[status(thm),theory(equality)],[31,52]),
[iquote('0:Res:31.1,52.0')] ).
cnf(4037,plain,
( ~ para(u,v,u,v)
| coll(u,w,v)
| cyclic(v,v,u,w) ),
inference(res,[status(thm),theory(equality)],[1288,59]),
[iquote('0:Res:1288.1,59.0')] ).
cnf(4048,plain,
( ~ para(u,v,u,v)
| ~ coll(u,w,v)
| cyclic(v,v,u,w) ),
inference(res,[status(thm),theory(equality)],[1288,76]),
[iquote('0:Res:1288.1,76.1')] ).
cnf(4061,plain,
( ~ para(u,v,u,v)
| cyclic(v,v,u,w) ),
inference(mrr,[status(thm)],[4048,4037]),
[iquote('0:MRR:4048.1,4037.1')] ).
cnf(4289,plain,
( ~ para(u,v,u,v)
| para(w,x,w,x) ),
inference(res,[status(thm),theory(equality)],[1320,30]),
[iquote('0:Res:1320.1,30.0')] ).
cnf(13836,plain,
para(u,v,u,v),
inference(res,[status(thm),theory(equality)],[777,4289]),
[iquote('0:Res:777.0,4289.0')] ).
cnf(13869,plain,
cyclic(u,u,v,w),
inference(mrr,[status(thm)],[4061,13836]),
[iquote('0:MRR:4061.0,13836.0')] ).
cnf(15520,plain,
( ~ cyclic(u,u,v,w)
| cyclic(u,v,w,x) ),
inference(res,[status(thm),theory(equality)],[13869,44]),
[iquote('0:Res:13869.0,44.0')] ).
cnf(15709,plain,
cyclic(u,v,w,x),
inference(mrr,[status(thm)],[15520,13869]),
[iquote('0:MRR:15520.0,13869.0')] ).
cnf(15710,plain,
$false,
inference(unc,[status(thm)],[15709,172]),
[iquote('0:UnC:15709.0,172.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO601+1 : TPTP v8.1.0. Released v7.5.0.
% 0.03/0.14 % Command : run_spass %d %s
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Fri Jun 17 16:00:49 EDT 2022
% 0.15/0.35 % CPUTime :
% 10.72/10.92
% 10.72/10.92 SPASS V 3.9
% 10.72/10.92 SPASS beiseite: Proof found.
% 10.72/10.92 % SZS status Theorem
% 10.72/10.92 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.72/10.92 SPASS derived 14236 clauses, backtracked 0 clauses, performed 3 splits and kept 9337 clauses.
% 10.72/10.92 SPASS allocated 98009 KBytes.
% 10.72/10.92 SPASS spent 0:0:10.33 on the problem.
% 10.72/10.92 0:00:00.04 for the input.
% 10.72/10.92 0:00:00.22 for the FLOTTER CNF translation.
% 10.72/10.92 0:00:00.27 for inferences.
% 10.72/10.92 0:00:00.07 for the backtracking.
% 10.72/10.92 0:00:09.48 for the reduction.
% 10.72/10.92
% 10.72/10.92
% 10.72/10.92 Here is a proof with depth 4, length 29 :
% 10.72/10.92 % SZS output start Refutation
% See solution above
% 10.72/10.92 Formulae used in the proof : exemplo6GDDFULL618063f ruleD8 ruleD16 ruleX11 ruleD39 ruleD40 ruleD9 ruleD17 ruleD19 ruleD21 ruleD42a ruleD42b
% 10.72/10.92
%------------------------------------------------------------------------------