TSTP Solution File: GEO199+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO199+3 : TPTP v8.1.0. Released v4.0.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:18 EDT 2022
% Result : Theorem 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 19 ( 9 unt; 8 nHn; 19 RR)
% Number of literals : 32 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
~ distinct_lines(u,u),
file('GEO199+3.p',unknown),
[] ).
cnf(8,axiom,
~ incident_point_and_line(intersection_point(skc3,skc5),skc4),
file('GEO199+3.p',unknown),
[] ).
cnf(9,axiom,
~ convergent_lines(parallel_through_point(u,v),u),
file('GEO199+3.p',unknown),
[] ).
cnf(10,axiom,
~ apart_point_and_line(u,parallel_through_point(v,u)),
file('GEO199+3.p',unknown),
[] ).
cnf(18,axiom,
( equal_lines(u,v)
| distinct_lines(u,v) ),
file('GEO199+3.p',unknown),
[] ).
cnf(20,axiom,
( incident_point_and_line(u,v)
| apart_point_and_line(u,v) ),
file('GEO199+3.p',unknown),
[] ).
cnf(22,axiom,
( ~ distinct_lines(u,v)
| convergent_lines(u,v) ),
file('GEO199+3.p',unknown),
[] ).
cnf(26,axiom,
( ~ distinct_lines(u,v)
| ~ equal_lines(u,v) ),
file('GEO199+3.p',unknown),
[] ).
cnf(31,axiom,
( ~ distinct_lines(u,v)
| distinct_lines(v,w)
| distinct_lines(u,w) ),
file('GEO199+3.p',unknown),
[] ).
cnf(38,axiom,
( ~ apart_point_and_line(u,v)
| distinct_lines(v,w)
| apart_point_and_line(u,w) ),
file('GEO199+3.p',unknown),
[] ).
cnf(80,plain,
apart_point_and_line(intersection_point(skc3,skc5),skc4),
inference(res,[status(thm),theory(equality)],[20,8]),
[iquote('0:Res:20.1,8.0')] ).
cnf(239,plain,
( equal_lines(u,v)
| distinct_lines(v,w)
| distinct_lines(u,w) ),
inference(res,[status(thm),theory(equality)],[18,31]),
[iquote('0:Res:18.1,31.0')] ).
cnf(286,plain,
( distinct_lines(skc4,u)
| apart_point_and_line(intersection_point(skc3,skc5),u) ),
inference(res,[status(thm),theory(equality)],[80,38]),
[iquote('0:Res:80.0,38.0')] ).
cnf(298,plain,
distinct_lines(skc4,parallel_through_point(u,intersection_point(skc3,skc5))),
inference(res,[status(thm),theory(equality)],[286,10]),
[iquote('0:Res:286.1,10.0')] ).
cnf(369,plain,
~ equal_lines(skc4,parallel_through_point(u,intersection_point(skc3,skc5))),
inference(res,[status(thm),theory(equality)],[298,26]),
[iquote('0:Res:298.0,26.0')] ).
cnf(606,plain,
( equal_lines(u,v)
| distinct_lines(v,u) ),
inference(res,[status(thm),theory(equality)],[239,5]),
[iquote('0:Res:239.2,5.0')] ).
cnf(617,plain,
( equal_lines(u,v)
| convergent_lines(v,u) ),
inference(res,[status(thm),theory(equality)],[606,22]),
[iquote('0:Res:606.1,22.0')] ).
cnf(619,plain,
equal_lines(u,parallel_through_point(u,v)),
inference(res,[status(thm),theory(equality)],[617,9]),
[iquote('0:Res:617.1,9.0')] ).
cnf(624,plain,
$false,
inference(unc,[status(thm)],[619,369]),
[iquote('0:UnC:619.0,369.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GEO199+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.11/0.33 % Computer : n026.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jun 18 18:18:24 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.48
% 0.18/0.48 SPASS V 3.9
% 0.18/0.48 SPASS beiseite: Proof found.
% 0.18/0.48 % SZS status Theorem
% 0.18/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.48 SPASS derived 566 clauses, backtracked 0 clauses, performed 0 splits and kept 431 clauses.
% 0.18/0.48 SPASS allocated 97986 KBytes.
% 0.18/0.48 SPASS spent 0:00:00.14 on the problem.
% 0.18/0.48 0:00:00.04 for the input.
% 0.18/0.48 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.48 0:00:00.01 for inferences.
% 0.18/0.48 0:00:00.00 for the backtracking.
% 0.18/0.48 0:00:00.04 for the reduction.
% 0.18/0.48
% 0.18/0.48
% 0.18/0.48 Here is a proof with depth 4, length 19 :
% 0.18/0.48 % SZS output start Refutation
% See solution above
% 0.18/0.48 Formulae used in the proof : apart2 con cp1 cp2 ax2 a4 p1 apart5 ceq2
% 0.18/0.48
%------------------------------------------------------------------------------