TSTP Solution File: GEO226+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO226+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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:41 EDT 2022
% Result : Theorem 0.21s 0.46s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 6 unt; 1 nHn; 11 RR)
% Number of literals : 18 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
convergent_lines(skc3,skc2),
file('GEO226+2.p',unknown),
[] ).
cnf(5,axiom,
~ distinct_points(u,u),
file('GEO226+2.p',unknown),
[] ).
cnf(8,axiom,
( apart_point_and_line(u,skc2)
| apart_point_and_line(u,skc3) ),
file('GEO226+2.p',unknown),
[] ).
cnf(19,axiom,
( ~ convergent_lines(u,v)
| ~ apart_point_and_line(w,u)
| distinct_points(w,intersection_point(u,v)) ),
file('GEO226+2.p',unknown),
[] ).
cnf(20,axiom,
( ~ convergent_lines(u,v)
| ~ apart_point_and_line(w,v)
| distinct_points(w,intersection_point(u,v)) ),
file('GEO226+2.p',unknown),
[] ).
cnf(33,plain,
( ~ apart_point_and_line(u,skc3)
| distinct_points(u,intersection_point(skc3,skc2)) ),
inference(res,[status(thm),theory(equality)],[4,19]),
[iquote('0:Res:4.0,19.1')] ).
cnf(34,plain,
( ~ apart_point_and_line(u,skc2)
| distinct_points(u,intersection_point(skc3,skc2)) ),
inference(res,[status(thm),theory(equality)],[4,20]),
[iquote('0:Res:4.0,20.1')] ).
cnf(55,plain,
~ apart_point_and_line(intersection_point(skc3,skc2),skc2),
inference(res,[status(thm),theory(equality)],[34,5]),
[iquote('0:Res:34.1,5.0')] ).
cnf(58,plain,
apart_point_and_line(intersection_point(skc3,skc2),skc3),
inference(res,[status(thm),theory(equality)],[8,55]),
[iquote('0:Res:8.0,55.0')] ).
cnf(61,plain,
~ apart_point_and_line(intersection_point(skc3,skc2),skc3),
inference(res,[status(thm),theory(equality)],[33,5]),
[iquote('0:Res:33.1,5.0')] ).
cnf(62,plain,
$false,
inference(mrr,[status(thm)],[61,58]),
[iquote('0:MRR:61.0,58.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GEO226+2 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : run_spass %d %s
% 0.14/0.36 % Computer : n016.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 20:46:21 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.46
% 0.21/0.46 SPASS V 3.9
% 0.21/0.46 SPASS beiseite: Proof found.
% 0.21/0.46 % SZS status Theorem
% 0.21/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.46 SPASS derived 25 clauses, backtracked 0 clauses, performed 0 splits and kept 36 clauses.
% 0.21/0.46 SPASS allocated 97656 KBytes.
% 0.21/0.46 SPASS spent 0:00:00.09 on the problem.
% 0.21/0.46 0:00:00.03 for the input.
% 0.21/0.46 0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.46 0:00:00.00 for inferences.
% 0.21/0.46 0:00:00.00 for the backtracking.
% 0.21/0.46 0:00:00.00 for the reduction.
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 Here is a proof with depth 3, length 11 :
% 0.21/0.46 % SZS output start Refutation
% See solution above
% 0.21/0.46 Formulae used in the proof : con apart1 con2
% 0.21/0.46
%------------------------------------------------------------------------------