TSTP Solution File: GEO595+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO595+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:25 EDT 2022
% Result : Theorem 7.50s 7.71s
% Output : Refutation 7.50s
% 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(1,axiom,
midp(skc12,skc18,skc11),
file('GEO595+1.p',unknown),
[] ).
cnf(9,axiom,
~ cyclic(skc17,skc16,skc14,skc13),
file('GEO595+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ midp(u,v,w)
| midp(u,w,v) ),
file('GEO595+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ para(u,v,w,x)
| para(u,v,x,w) ),
file('GEO595+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ para(u,v,w,x)
| para(w,x,u,v) ),
file('GEO595+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ eqangle(u,v,w,x,y,z,w,x)
| para(u,v,y,z) ),
file('GEO595+1.p',unknown),
[] ).
cnf(35,axiom,
( ~ para(u,v,w,x)
| eqangle(u,v,y,z,w,x,y,z) ),
file('GEO595+1.p',unknown),
[] ).
cnf(36,axiom,
( ~ cyclic(u,v,w,x)
| eqangle(w,u,w,v,x,u,x,v) ),
file('GEO595+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ midp(u,v,w)
| ~ midp(u,x,y)
| para(x,v,y,w) ),
file('GEO595+1.p',unknown),
[] ).
cnf(48,axiom,
( ~ cyclic(u,v,w,x)
| ~ cyclic(u,v,w,y)
| cyclic(v,w,y,x) ),
file('GEO595+1.p',unknown),
[] ).
cnf(56,axiom,
( ~ eqangle(u,v,w,x,y,z,x1,x2)
| eqangle(w,x,u,v,x1,x2,y,z) ),
file('GEO595+1.p',unknown),
[] ).
cnf(58,axiom,
( ~ eqangle(u,v,w,x,y,z,x1,x2)
| eqangle(u,v,y,z,w,x,x1,x2) ),
file('GEO595+1.p',unknown),
[] ).
cnf(63,axiom,
( ~ eqangle(u,v,u,w,x,v,x,w)
| coll(u,x,v)
| cyclic(v,w,u,x) ),
file('GEO595+1.p',unknown),
[] ).
cnf(80,axiom,
( ~ coll(u,v,w)
| ~ eqangle(u,x,u,w,v,x,v,w)
| cyclic(x,w,u,v) ),
file('GEO595+1.p',unknown),
[] ).
cnf(207,plain,
midp(skc12,skc11,skc18),
inference(res,[status(thm),theory(equality)],[1,12]),
[iquote('0:Res:1.0,12.0')] ).
cnf(209,plain,
( ~ midp(skc12,u,v)
| para(u,skc18,v,skc11) ),
inference(res,[status(thm),theory(equality)],[1,39]),
[iquote('0:Res:1.0,39.1')] ).
cnf(614,plain,
( ~ cyclic(u,v,w,w)
| para(w,u,w,u) ),
inference(res,[status(thm),theory(equality)],[36,34]),
[iquote('0:Res:36.1,34.0')] ).
cnf(1133,plain,
( ~ para(u,v,w,x)
| eqangle(u,v,w,x,y,z,y,z) ),
inference(res,[status(thm),theory(equality)],[35,58]),
[iquote('0:Res:35.1,58.0')] ).
cnf(1166,plain,
( ~ para(u,v,w,x)
| eqangle(y,z,u,v,y,z,w,x) ),
inference(res,[status(thm),theory(equality)],[35,56]),
[iquote('0:Res:35.1,56.0')] ).
cnf(2494,plain,
( ~ midp(skc12,u,v)
| para(u,skc18,skc11,v) ),
inference(res,[status(thm),theory(equality)],[209,16]),
[iquote('0:Res:209.1,16.0')] ).
cnf(3817,plain,
( ~ para(u,v,u,v)
| coll(u,w,v)
| cyclic(v,v,u,w) ),
inference(res,[status(thm),theory(equality)],[1133,63]),
[iquote('0:Res:1133.1,63.0')] ).
cnf(3828,plain,
( ~ para(u,v,u,v)
| ~ coll(u,w,v)
| cyclic(v,v,u,w) ),
inference(res,[status(thm),theory(equality)],[1133,80]),
[iquote('0:Res:1133.1,80.1')] ).
cnf(3843,plain,
( ~ para(u,v,u,v)
| cyclic(v,v,u,w) ),
inference(mrr,[status(thm)],[3828,3817]),
[iquote('0:MRR:3828.1,3817.1')] ).
cnf(4073,plain,
( ~ para(u,v,u,v)
| para(w,x,w,x) ),
inference(res,[status(thm),theory(equality)],[1166,34]),
[iquote('0:Res:1166.1,34.0')] ).
cnf(11199,plain,
( ~ midp(skc12,skc11,skc18)
| cyclic(skc18,skc18,skc11,u) ),
inference(res,[status(thm),theory(equality)],[2494,3843]),
[iquote('0:Res:2494.1,3843.0')] ).
cnf(11203,plain,
cyclic(skc18,skc18,skc11,u),
inference(mrr,[status(thm)],[11199,207]),
[iquote('0:MRR:11199.0,207.0')] ).
cnf(11221,plain,
para(skc11,skc18,skc11,skc18),
inference(res,[status(thm),theory(equality)],[11203,614]),
[iquote('0:Res:11203.0,614.0')] ).
cnf(11276,plain,
para(skc11,skc18,skc18,skc11),
inference(res,[status(thm),theory(equality)],[11221,16]),
[iquote('0:Res:11221.0,16.0')] ).
cnf(11346,plain,
para(skc18,skc11,skc11,skc18),
inference(res,[status(thm),theory(equality)],[11276,17]),
[iquote('0:Res:11276.0,17.0')] ).
cnf(11421,plain,
para(skc18,skc11,skc18,skc11),
inference(res,[status(thm),theory(equality)],[11346,16]),
[iquote('0:Res:11346.0,16.0')] ).
cnf(11784,plain,
para(u,v,u,v),
inference(res,[status(thm),theory(equality)],[11421,4073]),
[iquote('0:Res:11421.0,4073.0')] ).
cnf(11791,plain,
cyclic(u,u,v,w),
inference(mrr,[status(thm)],[3843,11784]),
[iquote('0:MRR:3843.0,11784.0')] ).
cnf(13292,plain,
( ~ cyclic(u,u,v,w)
| cyclic(u,v,w,x) ),
inference(res,[status(thm),theory(equality)],[11791,48]),
[iquote('0:Res:11791.0,48.0')] ).
cnf(13348,plain,
cyclic(u,v,w,x),
inference(mrr,[status(thm)],[13292,11791]),
[iquote('0:MRR:13292.0,11791.0')] ).
cnf(13349,plain,
$false,
inference(unc,[status(thm)],[13348,9]),
[iquote('0:UnC:13348.0,9.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO595+1 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 17 22:02:43 EDT 2022
% 0.13/0.34 % CPUTime :
% 7.50/7.71
% 7.50/7.71 SPASS V 3.9
% 7.50/7.71 SPASS beiseite: Proof found.
% 7.50/7.71 % SZS status Theorem
% 7.50/7.71 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.50/7.71 SPASS derived 12789 clauses, backtracked 0 clauses, performed 3 splits and kept 7799 clauses.
% 7.50/7.71 SPASS allocated 95553 KBytes.
% 7.50/7.71 SPASS spent 0:00:07.18 on the problem.
% 7.50/7.71 0:00:00.04 for the input.
% 7.50/7.71 0:00:00.24 for the FLOTTER CNF translation.
% 7.50/7.71 0:00:00.36 for inferences.
% 7.50/7.71 0:00:00.00 for the backtracking.
% 7.50/7.71 0:00:06.21 for the reduction.
% 7.50/7.71
% 7.50/7.71
% 7.50/7.71 Here is a proof with depth 8, length 35 :
% 7.50/7.71 % SZS output start Refutation
% See solution above
% 7.50/7.71 Formulae used in the proof : exemplo6GDDFULL416057 ruleD11 ruleD4 ruleD5 ruleD39 ruleD40 ruleD41 ruleD63 ruleD17 ruleD19 ruleD21 ruleD42a ruleD42b
% 7.50/7.71
%------------------------------------------------------------------------------