TSTP Solution File: GEO195+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO195+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n004.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:15 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 17 ( 8 unt; 7 nHn; 17 RR)
% Number of literals : 29 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 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('GEO195+3.p',unknown),
[] ).
cnf(7,axiom,
apart_point_and_line(intersection_point(skc5,skc3),skc4),
file('GEO195+3.p',unknown),
[] ).
cnf(9,axiom,
~ convergent_lines(parallel_through_point(u,v),u),
file('GEO195+3.p',unknown),
[] ).
cnf(10,axiom,
~ apart_point_and_line(u,parallel_through_point(v,u)),
file('GEO195+3.p',unknown),
[] ).
cnf(18,axiom,
( equal_lines(u,v)
| distinct_lines(u,v) ),
file('GEO195+3.p',unknown),
[] ).
cnf(22,axiom,
( ~ distinct_lines(u,v)
| convergent_lines(u,v) ),
file('GEO195+3.p',unknown),
[] ).
cnf(26,axiom,
( ~ distinct_lines(u,v)
| ~ equal_lines(u,v) ),
file('GEO195+3.p',unknown),
[] ).
cnf(31,axiom,
( ~ distinct_lines(u,v)
| distinct_lines(v,w)
| distinct_lines(u,w) ),
file('GEO195+3.p',unknown),
[] ).
cnf(38,axiom,
( ~ apart_point_and_line(u,v)
| distinct_lines(v,w)
| apart_point_and_line(u,w) ),
file('GEO195+3.p',unknown),
[] ).
cnf(80,plain,
( distinct_lines(skc4,u)
| apart_point_and_line(intersection_point(skc5,skc3),u) ),
inference(res,[status(thm),theory(equality)],[7,38]),
[iquote('0:Res:7.0,38.0')] ).
cnf(256,plain,
distinct_lines(skc4,parallel_through_point(u,intersection_point(skc5,skc3))),
inference(res,[status(thm),theory(equality)],[80,10]),
[iquote('0:Res:80.1,10.0')] ).
cnf(270,plain,
~ equal_lines(skc4,parallel_through_point(u,intersection_point(skc5,skc3))),
inference(res,[status(thm),theory(equality)],[256,26]),
[iquote('0:Res:256.0,26.0')] ).
cnf(282,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(679,plain,
( equal_lines(u,v)
| distinct_lines(v,u) ),
inference(res,[status(thm),theory(equality)],[282,5]),
[iquote('0:Res:282.2,5.0')] ).
cnf(690,plain,
( equal_lines(u,v)
| convergent_lines(v,u) ),
inference(res,[status(thm),theory(equality)],[679,22]),
[iquote('0:Res:679.1,22.0')] ).
cnf(692,plain,
equal_lines(u,parallel_through_point(u,v)),
inference(res,[status(thm),theory(equality)],[690,9]),
[iquote('0:Res:690.1,9.0')] ).
cnf(697,plain,
$false,
inference(unc,[status(thm)],[692,270]),
[iquote('0:UnC:692.0,270.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO195+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n004.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 04:45:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50
% 0.20/0.50 SPASS V 3.9
% 0.20/0.50 SPASS beiseite: Proof found.
% 0.20/0.50 % SZS status Theorem
% 0.20/0.50 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.50 SPASS derived 626 clauses, backtracked 0 clauses, performed 0 splits and kept 453 clauses.
% 0.20/0.50 SPASS allocated 98027 KBytes.
% 0.20/0.50 SPASS spent 0:00:00.14 on the problem.
% 0.20/0.50 0:00:00.03 for the input.
% 0.20/0.50 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.50 0:00:00.01 for inferences.
% 0.20/0.50 0:00:00.00 for the backtracking.
% 0.20/0.50 0:00:00.04 for the reduction.
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50 Here is a proof with depth 4, length 17 :
% 0.20/0.50 % SZS output start Refutation
% See solution above
% 0.20/0.50 Formulae used in the proof : apart2 con cp1 cp2 ax2 p1 apart5 ceq2
% 0.20/0.50
%------------------------------------------------------------------------------