TSTP Solution File: GEO192+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO192+2 : 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:12 EDT 2022
% Result : Theorem 0.21s 0.45s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 20 ( 9 unt; 5 nHn; 20 RR)
% Number of literals : 35 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 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(1,axiom,
convergent_lines(skc3,skc4),
file('GEO192+2.p',unknown),
[] ).
cnf(2,axiom,
~ distinct_points(u,u),
file('GEO192+2.p',unknown),
[] ).
cnf(3,axiom,
~ distinct_lines(u,u),
file('GEO192+2.p',unknown),
[] ).
cnf(5,axiom,
apart_point_and_line(intersection_point(skc3,skc4),skc5),
file('GEO192+2.p',unknown),
[] ).
cnf(7,axiom,
( ~ distinct_lines(skc4,skc5)
| ~ distinct_lines(skc3,skc5) ),
file('GEO192+2.p',unknown),
[] ).
cnf(9,axiom,
( ~ distinct_lines(u,v)
| distinct_lines(v,w)
| distinct_lines(u,w) ),
file('GEO192+2.p',unknown),
[] ).
cnf(12,axiom,
( ~ apart_point_and_line(u,v)
| distinct_lines(v,w)
| apart_point_and_line(u,w) ),
file('GEO192+2.p',unknown),
[] ).
cnf(15,axiom,
( ~ convergent_lines(u,v)
| ~ apart_point_and_line(w,u)
| distinct_points(w,intersection_point(u,v)) ),
file('GEO192+2.p',unknown),
[] ).
cnf(16,axiom,
( ~ convergent_lines(u,v)
| ~ apart_point_and_line(w,v)
| distinct_points(w,intersection_point(u,v)) ),
file('GEO192+2.p',unknown),
[] ).
cnf(20,plain,
( ~ apart_point_and_line(u,skc3)
| distinct_points(u,intersection_point(skc3,skc4)) ),
inference(res,[status(thm),theory(equality)],[1,15]),
[iquote('0:Res:1.0,15.1')] ).
cnf(21,plain,
( ~ apart_point_and_line(u,skc4)
| distinct_points(u,intersection_point(skc3,skc4)) ),
inference(res,[status(thm),theory(equality)],[1,16]),
[iquote('0:Res:1.0,16.1')] ).
cnf(25,plain,
( distinct_lines(skc5,u)
| apart_point_and_line(intersection_point(skc3,skc4),u) ),
inference(res,[status(thm),theory(equality)],[5,12]),
[iquote('0:Res:5.0,12.0')] ).
cnf(38,plain,
~ apart_point_and_line(intersection_point(skc3,skc4),skc4),
inference(res,[status(thm),theory(equality)],[21,2]),
[iquote('0:Res:21.1,2.0')] ).
cnf(39,plain,
distinct_lines(skc5,skc4),
inference(res,[status(thm),theory(equality)],[25,38]),
[iquote('0:Res:25.1,38.0')] ).
cnf(43,plain,
( distinct_lines(skc4,u)
| distinct_lines(skc5,u) ),
inference(res,[status(thm),theory(equality)],[39,9]),
[iquote('0:Res:39.0,9.0')] ).
cnf(55,plain,
~ apart_point_and_line(intersection_point(skc3,skc4),skc3),
inference(res,[status(thm),theory(equality)],[20,2]),
[iquote('0:Res:20.1,2.0')] ).
cnf(56,plain,
distinct_lines(skc5,skc3),
inference(res,[status(thm),theory(equality)],[25,55]),
[iquote('0:Res:25.1,55.0')] ).
cnf(59,plain,
( distinct_lines(skc3,u)
| distinct_lines(skc5,u) ),
inference(res,[status(thm),theory(equality)],[56,9]),
[iquote('0:Res:56.0,9.0')] ).
cnf(62,plain,
( ~ distinct_lines(skc4,skc5)
| distinct_lines(skc5,skc5) ),
inference(res,[status(thm),theory(equality)],[59,7]),
[iquote('0:Res:59.0,7.1')] ).
cnf(63,plain,
$false,
inference(mrr,[status(thm)],[62,43,3]),
[iquote('0:MRR:62.0,62.1,43.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO192+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.15/0.35 % Computer : n014.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Fri Jun 17 16:02:19 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.21/0.45
% 0.21/0.45 SPASS V 3.9
% 0.21/0.45 SPASS beiseite: Proof found.
% 0.21/0.45 % SZS status Theorem
% 0.21/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.45 SPASS derived 44 clauses, backtracked 0 clauses, performed 0 splits and kept 49 clauses.
% 0.21/0.45 SPASS allocated 85142 KBytes.
% 0.21/0.45 SPASS spent 0:00:00.08 on the problem.
% 0.21/0.45 0:00:00.04 for the input.
% 0.21/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.45 0:00:00.00 for inferences.
% 0.21/0.45 0:00:00.00 for the backtracking.
% 0.21/0.45 0:00:00.00 for the reduction.
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 Here is a proof with depth 5, length 20 :
% 0.21/0.45 % SZS output start Refutation
% See solution above
% 0.21/0.45 Formulae used in the proof : con apart1 apart2 apart5 ceq2 con2
% 0.21/0.45
%------------------------------------------------------------------------------