TSTP Solution File: GEO185+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO185+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n032.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:06 EDT 2022
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 18 ( 9 unt; 5 nHn; 18 RR)
% Number of literals : 29 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
convergent_lines(skc4,skc5),
file('GEO185+3.p',unknown),
[] ).
cnf(6,axiom,
equal_points(skc6,intersection_point(skc4,skc5)),
file('GEO185+3.p',unknown),
[] ).
cnf(18,axiom,
( incident_point_and_line(u,v)
| apart_point_and_line(u,v) ),
file('GEO185+3.p',unknown),
[] ).
cnf(23,axiom,
( ~ incident_point_and_line(skc6,skc5)
| ~ incident_point_and_line(skc6,skc4) ),
file('GEO185+3.p',unknown),
[] ).
cnf(24,axiom,
( ~ distinct_points(u,v)
| ~ equal_points(u,v) ),
file('GEO185+3.p',unknown),
[] ).
cnf(34,axiom,
( ~ convergent_lines(u,v)
| ~ apart_point_and_line(intersection_point(u,v),u) ),
file('GEO185+3.p',unknown),
[] ).
cnf(35,axiom,
( ~ convergent_lines(u,v)
| ~ apart_point_and_line(intersection_point(u,v),v) ),
file('GEO185+3.p',unknown),
[] ).
cnf(36,axiom,
( ~ apart_point_and_line(u,v)
| apart_point_and_line(w,v)
| distinct_points(u,w) ),
file('GEO185+3.p',unknown),
[] ).
cnf(54,plain,
~ apart_point_and_line(intersection_point(skc4,skc5),skc4),
inference(res,[status(thm),theory(equality)],[2,34]),
[iquote('0:Res:2.0,34.0')] ).
cnf(55,plain,
~ apart_point_and_line(intersection_point(skc4,skc5),skc5),
inference(res,[status(thm),theory(equality)],[2,35]),
[iquote('0:Res:2.0,35.0')] ).
cnf(66,plain,
~ distinct_points(skc6,intersection_point(skc4,skc5)),
inference(res,[status(thm),theory(equality)],[6,24]),
[iquote('0:Res:6.0,24.0')] ).
cnf(189,plain,
( incident_point_and_line(u,v)
| apart_point_and_line(w,v)
| distinct_points(u,w) ),
inference(res,[status(thm),theory(equality)],[18,36]),
[iquote('0:Res:18.1,36.0')] ).
cnf(485,plain,
( incident_point_and_line(u,skc5)
| distinct_points(u,intersection_point(skc4,skc5)) ),
inference(res,[status(thm),theory(equality)],[189,55]),
[iquote('0:Res:189.1,55.0')] ).
cnf(486,plain,
( incident_point_and_line(u,skc4)
| distinct_points(u,intersection_point(skc4,skc5)) ),
inference(res,[status(thm),theory(equality)],[189,54]),
[iquote('0:Res:189.1,54.0')] ).
cnf(532,plain,
incident_point_and_line(skc6,skc5),
inference(res,[status(thm),theory(equality)],[485,66]),
[iquote('0:Res:485.1,66.0')] ).
cnf(536,plain,
~ incident_point_and_line(skc6,skc4),
inference(mrr,[status(thm)],[23,532]),
[iquote('0:MRR:23.0,532.0')] ).
cnf(551,plain,
incident_point_and_line(skc6,skc4),
inference(res,[status(thm),theory(equality)],[486,66]),
[iquote('0:Res:486.1,66.0')] ).
cnf(555,plain,
$false,
inference(mrr,[status(thm)],[551,536]),
[iquote('0:MRR:551.0,536.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : GEO185+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.10 % Command : run_spass %d %s
% 0.10/0.28 % Computer : n032.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8042.1875MB
% 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28 % CPULimit : 300
% 0.10/0.28 % WCLimit : 600
% 0.10/0.28 % DateTime : Sat Jun 18 17:13:32 EDT 2022
% 0.10/0.28 % CPUTime :
% 0.14/0.38
% 0.14/0.38 SPASS V 3.9
% 0.14/0.38 SPASS beiseite: Proof found.
% 0.14/0.38 % SZS status Theorem
% 0.14/0.38 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 SPASS derived 500 clauses, backtracked 0 clauses, performed 0 splits and kept 381 clauses.
% 0.14/0.38 SPASS allocated 97941 KBytes.
% 0.14/0.38 SPASS spent 0:00:00.09 on the problem.
% 0.14/0.38 0:00:00.02 for the input.
% 0.14/0.38 0:00:00.02 for the FLOTTER CNF translation.
% 0.14/0.38 0:00:00.00 for inferences.
% 0.14/0.38 0:00:00.00 for the backtracking.
% 0.14/0.38 0:00:00.02 for the reduction.
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 Here is a proof with depth 3, length 18 :
% 0.14/0.38 % SZS output start Refutation
% See solution above
% 0.14/0.38 Formulae used in the proof : con a4 ax1 ci3 ci4 ceq1
% 0.14/0.38
%------------------------------------------------------------------------------