%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO215+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:32 EDT 2022
% Result : Theorem 0.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 9 unt; 5 nHn; 17 RR)
% Number of literals : 32 ( 0 equ; 15 neg)
% Maximal clause size : 5 ( 1 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('GEO215+1.p',unknown),
[] ).
cnf(2,axiom,
~ unorthogonal_lines(skc5,skc4),
file('GEO215+1.p',unknown),
[] ).
cnf(3,axiom,
~ unorthogonal_lines(skc3,skc4),
file('GEO215+1.p',unknown),
[] ).
cnf(6,axiom,
~ convergent_lines(u,u),
file('GEO215+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ convergent_lines(u,v)
| ~ apart_point_and_line(intersection_point(u,v),u) ),
file('GEO215+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ convergent_lines(u,v)
| ~ apart_point_and_line(intersection_point(u,v),v) ),
file('GEO215+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ convergent_lines(u,v)
| distinct_lines(v,w)
| convergent_lines(u,w) ),
file('GEO215+1.p',unknown),
[] ).
cnf(27,axiom,
( ~ distinct_lines(u,v)
| unorthogonal_lines(v,w)
| unorthogonal_lines(u,w)
| apart_point_and_line(x,v)
| apart_point_and_line(x,u) ),
file('GEO215+1.p',unknown),
[] ).
cnf(31,plain,
~ apart_point_and_line(intersection_point(skc5,skc3),skc5),
inference(res,[status(thm),theory(equality)],[1,19]),
[iquote('0:Res:1.0,19.0')] ).
cnf(32,plain,
~ apart_point_and_line(intersection_point(skc5,skc3),skc3),
inference(res,[status(thm),theory(equality)],[1,20]),
[iquote('0:Res:1.0,20.0')] ).
cnf(33,plain,
( distinct_lines(skc3,u)
| convergent_lines(skc5,u) ),
inference(res,[status(thm),theory(equality)],[1,23]),
[iquote('0:Res:1.0,23.0')] ).
cnf(36,plain,
( ~ distinct_lines(skc3,u)
| apart_point_and_line(v,u)
| unorthogonal_lines(u,skc4)
| apart_point_and_line(v,skc3) ),
inference(res,[status(thm),theory(equality)],[27,3]),
[iquote('0:Res:27.3,3.0')] ).
cnf(45,plain,
( ~ distinct_lines(skc3,skc5)
| apart_point_and_line(u,skc5)
| apart_point_and_line(u,skc3) ),
inference(res,[status(thm),theory(equality)],[36,2]),
[iquote('0:Res:36.3,2.0')] ).
cnf(63,plain,
( ~ distinct_lines(skc3,skc5)
| apart_point_and_line(intersection_point(skc5,skc3),skc5) ),
inference(res,[status(thm),theory(equality)],[45,32]),
[iquote('0:Res:45.2,32.0')] ).
cnf(65,plain,
~ distinct_lines(skc3,skc5),
inference(mrr,[status(thm)],[63,31]),
[iquote('0:MRR:63.1,31.0')] ).
cnf(66,plain,
convergent_lines(skc5,skc5),
inference(res,[status(thm),theory(equality)],[33,65]),
[iquote('0:Res:33.0,65.0')] ).
cnf(67,plain,
$false,
inference(mrr,[status(thm)],[66,6]),
[iquote('0:MRR:66.0,6.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO215+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n014.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 00:40:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45
% 0.19/0.45 SPASS V 3.9
% 0.19/0.45 SPASS beiseite: Proof found.
% 0.19/0.45 % SZS status Theorem
% 0.19/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 SPASS derived 32 clauses, backtracked 0 clauses, performed 0 splits and kept 47 clauses.
% 0.19/0.45 SPASS allocated 85195 KBytes.
% 0.19/0.45 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.45 0:00:00.04 for the input.
% 0.19/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.45 0:00:00.00 for inferences.
% 0.19/0.45 0:00:00.00 for the backtracking.
% 0.19/0.45 0:00:00.00 for the reduction.
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Here is a proof with depth 4, length 17 :
% 0.19/0.45 % SZS output start Refutation
% See solution above
% 0.19/0.45 Formulae used in the proof : con apart3 ci3 ci4 ceq3 ouo1
% 0.19/0.45
%------------------------------------------------------------------------------