TSTP Solution File: GEO193+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO193+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.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:12 EDT 2022
% Result : Theorem 0.22s 0.51s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 30 ( 13 unt; 14 nHn; 30 RR)
% Number of literals : 63 ( 0 equ; 21 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('GEO193+1.p',unknown),
[] ).
cnf(3,axiom,
convergent_lines(skc4,skc3),
file('GEO193+1.p',unknown),
[] ).
cnf(6,axiom,
~ convergent_lines(u,u),
file('GEO193+1.p',unknown),
[] ).
cnf(7,axiom,
apart_point_and_line(intersection_point(skc5,skc3),skc4),
file('GEO193+1.p',unknown),
[] ).
cnf(8,axiom,
~ apart_point_and_line(intersection_point(skc4,skc3),skc5),
file('GEO193+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ convergent_lines(u,v)
| convergent_lines(v,w)
| convergent_lines(u,w) ),
file('GEO193+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ convergent_lines(u,v)
| ~ apart_point_and_line(intersection_point(u,v),u) ),
file('GEO193+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ convergent_lines(u,v)
| ~ apart_point_and_line(intersection_point(u,v),v) ),
file('GEO193+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ apart_point_and_line(u,v)
| apart_point_and_line(w,v)
| distinct_points(u,w) ),
file('GEO193+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ convergent_lines(u,v)
| distinct_lines(v,w)
| convergent_lines(u,w) ),
file('GEO193+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('GEO193+1.p',unknown),
[] ).
cnf(21,plain,
~ apart_point_and_line(intersection_point(skc4,skc3),skc4),
inference(res,[status(thm),theory(equality)],[3,14]),
[iquote('0:Res:3.0,14.0')] ).
cnf(22,plain,
~ apart_point_and_line(intersection_point(skc4,skc3),skc3),
inference(res,[status(thm),theory(equality)],[3,15]),
[iquote('0:Res:3.0,15.0')] ).
cnf(28,plain,
( convergent_lines(skc3,u)
| convergent_lines(skc5,u) ),
inference(res,[status(thm),theory(equality)],[1,11]),
[iquote('0:Res:1.0,11.0')] ).
cnf(29,plain,
~ apart_point_and_line(intersection_point(skc5,skc3),skc5),
inference(res,[status(thm),theory(equality)],[1,14]),
[iquote('0:Res:1.0,14.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,skc4)
| distinct_points(intersection_point(skc5,skc3),u) ),
inference(res,[status(thm),theory(equality)],[7,16]),
[iquote('0:Res:7.0,16.0')] ).
cnf(39,plain,
( ~ distinct_points(u,intersection_point(skc4,skc3))
| ~ distinct_lines(skc5,v)
| apart_point_and_line(u,v)
| apart_point_and_line(u,skc5)
| apart_point_and_line(intersection_point(skc4,skc3),v) ),
inference(res,[status(thm),theory(equality)],[19,8]),
[iquote('0:Res:19.5,8.0')] ).
cnf(86,plain,
( convergent_lines(skc5,u)
| convergent_lines(u,v)
| convergent_lines(skc3,v) ),
inference(res,[status(thm),theory(equality)],[28,11]),
[iquote('0:Res:28.0,11.0')] ).
cnf(192,plain,
( convergent_lines(skc5,u)
| convergent_lines(u,skc3) ),
inference(res,[status(thm),theory(equality)],[86,6]),
[iquote('0:Res:86.2,6.0')] ).
cnf(196,plain,
( convergent_lines(u,skc3)
| convergent_lines(u,v)
| convergent_lines(skc5,v) ),
inference(res,[status(thm),theory(equality)],[192,11]),
[iquote('0:Res:192.0,11.0')] ).
cnf(222,plain,
( ~ distinct_lines(skc5,u)
| apart_point_and_line(intersection_point(skc4,skc3),skc4)
| apart_point_and_line(intersection_point(skc5,skc3),u)
| apart_point_and_line(intersection_point(skc5,skc3),skc5)
| apart_point_and_line(intersection_point(skc4,skc3),u) ),
inference(res,[status(thm),theory(equality)],[32,39]),
[iquote('0:Res:32.1,39.0')] ).
cnf(223,plain,
( ~ distinct_lines(skc5,u)
| apart_point_and_line(intersection_point(skc5,skc3),u)
| apart_point_and_line(intersection_point(skc4,skc3),u) ),
inference(mrr,[status(thm)],[222,21,29]),
[iquote('0:MRR:222.1,222.3,21.0,29.0')] ).
cnf(352,plain,
( convergent_lines(u,skc3)
| convergent_lines(u,skc5) ),
inference(res,[status(thm),theory(equality)],[196,6]),
[iquote('0:Res:196.2,6.0')] ).
cnf(371,plain,
convergent_lines(skc3,skc5),
inference(res,[status(thm),theory(equality)],[352,6]),
[iquote('0:Res:352.0,6.0')] ).
cnf(375,plain,
( distinct_lines(skc5,u)
| convergent_lines(skc3,u) ),
inference(res,[status(thm),theory(equality)],[371,18]),
[iquote('0:Res:371.0,18.0')] ).
cnf(490,plain,
( ~ distinct_lines(skc5,skc3)
| apart_point_and_line(intersection_point(skc5,skc3),skc3) ),
inference(res,[status(thm),theory(equality)],[223,22]),
[iquote('0:Res:223.2,22.0')] ).
cnf(500,plain,
~ distinct_lines(skc5,skc3),
inference(mrr,[status(thm)],[490,30]),
[iquote('0:MRR:490.1,30.0')] ).
cnf(502,plain,
convergent_lines(skc3,skc3),
inference(res,[status(thm),theory(equality)],[375,500]),
[iquote('0:Res:375.0,500.0')] ).
cnf(515,plain,
$false,
inference(mrr,[status(thm)],[502,6]),
[iquote('0:MRR:502.0,6.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : GEO193+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.14 % Command : run_spass %d %s
% 0.14/0.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Fri Jun 17 19:31:04 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.51
% 0.22/0.51 SPASS V 3.9
% 0.22/0.51 SPASS beiseite: Proof found.
% 0.22/0.51 % SZS status Theorem
% 0.22/0.51 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.51 SPASS derived 462 clauses, backtracked 0 clauses, performed 0 splits and kept 292 clauses.
% 0.22/0.51 SPASS allocated 85339 KBytes.
% 0.22/0.51 SPASS spent 0:00:00.14 on the problem.
% 0.22/0.51 0:00:00.04 for the input.
% 0.22/0.51 0:00:00.03 for the FLOTTER CNF translation.
% 0.22/0.51 0:00:00.01 for inferences.
% 0.22/0.51 0:00:00.00 for the backtracking.
% 0.22/0.51 0:00:00.04 for the reduction.
% 0.22/0.51
% 0.22/0.51
% 0.22/0.51 Here is a proof with depth 8, length 30 :
% 0.22/0.51 % SZS output start Refutation
% See solution above
% 0.22/0.51 Formulae used in the proof : con apart3 ax6 ci3 ci4 ceq1 ceq3 cu1
% 0.22/0.51
%------------------------------------------------------------------------------