TSTP Solution File: GEO198+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO198+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:23:17 EDT 2022
% Result : Theorem 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 30 ( 12 unt; 15 nHn; 30 RR)
% Number of literals : 66 ( 0 equ; 20 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
convergent_lines(skc5,skc3),
file('GEO198+1.p',unknown),
[] ).
cnf(2,axiom,
convergent_lines(skc5,skc4),
file('GEO198+1.p',unknown),
[] ).
cnf(6,axiom,
~ convergent_lines(u,u),
file('GEO198+1.p',unknown),
[] ).
cnf(7,axiom,
apart_point_and_line(intersection_point(skc5,skc4),skc3),
file('GEO198+1.p',unknown),
[] ).
cnf(8,axiom,
~ apart_point_and_line(intersection_point(skc5,skc3),skc4),
file('GEO198+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ convergent_lines(u,v)
| convergent_lines(v,w)
| convergent_lines(u,w) ),
file('GEO198+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ convergent_lines(u,v)
| ~ apart_point_and_line(intersection_point(u,v),u) ),
file('GEO198+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ convergent_lines(u,v)
| ~ apart_point_and_line(intersection_point(u,v),v) ),
file('GEO198+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ apart_point_and_line(u,v)
| apart_point_and_line(w,v)
| distinct_points(u,w) ),
file('GEO198+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ convergent_lines(u,v)
| distinct_lines(v,w)
| convergent_lines(u,w) ),
file('GEO198+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ distinct_lines(u,v)
| ~ distinct_points(w,x)
| apart_point_and_line(x,u)
| apart_point_and_line(x,v)
| apart_point_and_line(w,v)
| apart_point_and_line(w,u) ),
file('GEO198+1.p',unknown),
[] ).
cnf(24,plain,
( convergent_lines(skc4,u)
| convergent_lines(skc5,u) ),
inference(res,[status(thm),theory(equality)],[2,11]),
[iquote('0:Res:2.0,11.0')] ).
cnf(25,plain,
~ apart_point_and_line(intersection_point(skc5,skc4),skc5),
inference(res,[status(thm),theory(equality)],[2,14]),
[iquote('0:Res:2.0,14.0')] ).
cnf(26,plain,
~ apart_point_and_line(intersection_point(skc5,skc4),skc4),
inference(res,[status(thm),theory(equality)],[2,15]),
[iquote('0:Res:2.0,15.0')] ).
cnf(30,plain,
~ apart_point_and_line(intersection_point(skc5,skc3),skc3),
inference(res,[status(thm),theory(equality)],[1,15]),
[iquote('0:Res:1.0,15.0')] ).
cnf(32,plain,
( apart_point_and_line(u,skc3)
| distinct_points(intersection_point(skc5,skc4),u) ),
inference(res,[status(thm),theory(equality)],[7,16]),
[iquote('0:Res:7.0,16.0')] ).
cnf(39,plain,
( ~ distinct_points(u,intersection_point(skc5,skc3))
| ~ distinct_lines(skc4,v)
| apart_point_and_line(u,v)
| apart_point_and_line(u,skc4)
| apart_point_and_line(intersection_point(skc5,skc3),v) ),
inference(res,[status(thm),theory(equality)],[19,8]),
[iquote('0:Res:19.5,8.0')] ).
cnf(81,plain,
( convergent_lines(skc5,u)
| convergent_lines(u,v)
| convergent_lines(skc4,v) ),
inference(res,[status(thm),theory(equality)],[24,11]),
[iquote('0:Res:24.0,11.0')] ).
cnf(166,plain,
( convergent_lines(skc5,u)
| convergent_lines(u,skc4) ),
inference(res,[status(thm),theory(equality)],[81,6]),
[iquote('0:Res:81.2,6.0')] ).
cnf(169,plain,
( convergent_lines(u,skc4)
| convergent_lines(u,v)
| convergent_lines(skc5,v) ),
inference(res,[status(thm),theory(equality)],[166,11]),
[iquote('0:Res:166.0,11.0')] ).
cnf(222,plain,
( ~ distinct_lines(skc4,u)
| apart_point_and_line(intersection_point(skc5,skc3),skc3)
| apart_point_and_line(intersection_point(skc5,skc4),u)
| apart_point_and_line(intersection_point(skc5,skc4),skc4)
| apart_point_and_line(intersection_point(skc5,skc3),u) ),
inference(res,[status(thm),theory(equality)],[32,39]),
[iquote('0:Res:32.1,39.0')] ).
cnf(223,plain,
( ~ distinct_lines(skc4,u)
| apart_point_and_line(intersection_point(skc5,skc4),u)
| apart_point_and_line(intersection_point(skc5,skc3),u) ),
inference(mrr,[status(thm)],[222,30,26]),
[iquote('0:MRR:222.1,222.3,30.0,26.0')] ).
cnf(251,plain,
( convergent_lines(u,skc4)
| convergent_lines(u,skc5) ),
inference(res,[status(thm),theory(equality)],[169,6]),
[iquote('0:Res:169.2,6.0')] ).
cnf(259,plain,
( convergent_lines(u,skc5)
| distinct_lines(skc4,v)
| convergent_lines(u,v) ),
inference(res,[status(thm),theory(equality)],[251,18]),
[iquote('0:Res:251.0,18.0')] ).
cnf(451,plain,
( distinct_lines(skc4,skc5)
| convergent_lines(u,skc5) ),
inference(fac,[status(thm)],[259]),
[iquote('0:Fac:259.0,259.2')] ).
cnf(462,plain,
convergent_lines(u,skc5),
inference(spt,[spt(split,[position(s1)])],[451]),
[iquote('1:Spt:451.1')] ).
cnf(463,plain,
$false,
inference(unc,[status(thm)],[462,6]),
[iquote('1:UnC:462.0,6.0')] ).
cnf(464,plain,
distinct_lines(skc4,skc5),
inference(spt,[spt(split,[position(s2)])],[451]),
[iquote('1:Spt:463.0,451.0')] ).
cnf(480,plain,
( ~ distinct_lines(skc4,skc5)
| ~ convergent_lines(skc5,skc3)
| apart_point_and_line(intersection_point(skc5,skc4),skc5) ),
inference(res,[status(thm),theory(equality)],[223,14]),
[iquote('0:Res:223.2,14.1')] ).
cnf(487,plain,
$false,
inference(mrr,[status(thm)],[480,464,1,25]),
[iquote('1:MRR:480.0,480.1,480.2,464.0,1.0,25.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO198+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n026.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 : Sat Jun 18 19:05:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.48
% 0.20/0.48 SPASS V 3.9
% 0.20/0.48 SPASS beiseite: Proof found.
% 0.20/0.48 % SZS status Theorem
% 0.20/0.48 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 SPASS derived 436 clauses, backtracked 1 clauses, performed 1 splits and kept 287 clauses.
% 0.20/0.48 SPASS allocated 85330 KBytes.
% 0.20/0.48 SPASS spent 0:00:00.13 on the problem.
% 0.20/0.48 0:00:00.03 for the input.
% 0.20/0.48 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.48 0:00:00.01 for inferences.
% 0.20/0.48 0:00:00.00 for the backtracking.
% 0.20/0.48 0:00:00.04 for the reduction.
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Here is a proof with depth 8, length 30 :
% 0.20/0.48 % SZS output start Refutation
% See solution above
% 0.20/0.48 Formulae used in the proof : con apart3 ax6 ci3 ci4 ceq1 ceq3 cu1
% 0.20/0.48
%------------------------------------------------------------------------------