TSTP Solution File: GEO643+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO643+1 : TPTP v8.1.0. Released v7.5.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 06:25:41 EDT 2022
% Result : Theorem 10.08s 10.32s
% Output : Refutation 10.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 27 ( 9 unt; 2 nHn; 27 RR)
% Number of literals : 51 ( 0 equ; 23 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 : 16 ( 16 usr; 15 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
circle(skc13,skc18,skc19,skc15),
file('GEO643+1.p',unknown),
[] ).
cnf(9,axiom,
~ cyclic(skc12,skc13,skc11,skc10),
file('GEO643+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ perp(u,v,w,x)
| perp(w,x,u,v) ),
file('GEO643+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ circle(u,v,w,x)
| perp(skf31(u,v),v,v,u) ),
file('GEO643+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ eqangle(u,v,w,x,y,z,w,x)
| para(u,v,y,z) ),
file('GEO643+1.p',unknown),
[] ).
cnf(35,axiom,
( ~ para(u,v,w,x)
| eqangle(u,v,y,z,w,x,y,z) ),
file('GEO643+1.p',unknown),
[] ).
cnf(45,axiom,
( ~ perp(u,v,w,x)
| ~ perp(y,z,u,v)
| para(y,z,w,x) ),
file('GEO643+1.p',unknown),
[] ).
cnf(48,axiom,
( ~ cyclic(u,v,w,x)
| ~ cyclic(u,v,w,y)
| cyclic(v,w,y,x) ),
file('GEO643+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('GEO643+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('GEO643+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('GEO643+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('GEO643+1.p',unknown),
[] ).
cnf(240,plain,
perp(skf31(skc13,skc18),skc18,skc18,skc13),
inference(res,[status(thm),theory(equality)],[6,26]),
[iquote('0:Res:6.0,26.0')] ).
cnf(334,plain,
perp(skc18,skc13,skf31(skc13,skc18),skc18),
inference(res,[status(thm),theory(equality)],[240,19]),
[iquote('0:Res:240.0,19.0')] ).
cnf(794,plain,
( ~ perp(u,v,skf31(skc13,skc18),skc18)
| para(u,v,skc18,skc13) ),
inference(res,[status(thm),theory(equality)],[240,45]),
[iquote('0:Res:240.0,45.0')] ).
cnf(1187,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(1219,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(4183,plain,
( ~ para(u,v,u,v)
| coll(u,w,v)
| cyclic(v,v,u,w) ),
inference(res,[status(thm),theory(equality)],[1187,63]),
[iquote('0:Res:1187.1,63.0')] ).
cnf(4194,plain,
( ~ para(u,v,u,v)
| ~ coll(u,w,v)
| cyclic(v,v,u,w) ),
inference(res,[status(thm),theory(equality)],[1187,80]),
[iquote('0:Res:1187.1,80.1')] ).
cnf(4210,plain,
( ~ para(u,v,u,v)
| cyclic(v,v,u,w) ),
inference(mrr,[status(thm)],[4194,4183]),
[iquote('0:MRR:4194.1,4183.1')] ).
cnf(4511,plain,
( ~ para(u,v,u,v)
| para(w,x,w,x) ),
inference(res,[status(thm),theory(equality)],[1219,34]),
[iquote('0:Res:1219.1,34.0')] ).
cnf(14056,plain,
para(skc18,skc13,skc18,skc13),
inference(res,[status(thm),theory(equality)],[334,794]),
[iquote('0:Res:334.0,794.0')] ).
cnf(14083,plain,
para(u,v,u,v),
inference(res,[status(thm),theory(equality)],[14056,4511]),
[iquote('0:Res:14056.0,4511.0')] ).
cnf(14100,plain,
cyclic(u,u,v,w),
inference(mrr,[status(thm)],[4210,14083]),
[iquote('0:MRR:4210.0,14083.0')] ).
cnf(17541,plain,
( ~ cyclic(u,u,v,w)
| cyclic(u,v,w,x) ),
inference(res,[status(thm),theory(equality)],[14100,48]),
[iquote('0:Res:14100.0,48.0')] ).
cnf(17675,plain,
cyclic(u,v,w,x),
inference(mrr,[status(thm)],[17541,14100]),
[iquote('0:MRR:17541.0,14100.0')] ).
cnf(17676,plain,
$false,
inference(unc,[status(thm)],[17675,9]),
[iquote('0:UnC:17675.0,9.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO643+1 : TPTP v8.1.0. Released v7.5.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 18 13:20:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 10.08/10.32
% 10.08/10.32 SPASS V 3.9
% 10.08/10.32 SPASS beiseite: Proof found.
% 10.08/10.32 % SZS status Theorem
% 10.08/10.32 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.08/10.32 SPASS derived 16858 clauses, backtracked 0 clauses, performed 3 splits and kept 10750 clauses.
% 10.08/10.32 SPASS allocated 99033 KBytes.
% 10.08/10.32 SPASS spent 0:00:09.88 on the problem.
% 10.08/10.32 0:00:00.04 for the input.
% 10.08/10.32 0:00:00.20 for the FLOTTER CNF translation.
% 10.08/10.32 0:00:00.36 for inferences.
% 10.08/10.32 0:00:00.00 for the backtracking.
% 10.08/10.32 0:00:08.93 for the reduction.
% 10.08/10.32
% 10.08/10.32
% 10.08/10.32 Here is a proof with depth 4, length 27 :
% 10.08/10.32 % SZS output start Refutation
% See solution above
% 10.08/10.32 Formulae used in the proof : exemplo6GDDFULL81109109F ruleD8 ruleX11 ruleD39 ruleD40 ruleD9 ruleD17 ruleD19 ruleD21 ruleD42a ruleD42b
% 10.08/10.32
%------------------------------------------------------------------------------