TSTP Solution File: GEO176+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO176+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.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:22:58 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 5 unt; 1 nHn; 10 RR)
% Number of literals : 17 ( 0 equ; 10 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
convergent_lines(skc4,skc5),
file('GEO176+2.p',unknown),
[] ).
cnf(6,axiom,
~ distinct_points(skc6,intersection_point(skc4,skc5)),
file('GEO176+2.p',unknown),
[] ).
cnf(7,axiom,
( apart_point_and_line(skc6,skc4)
| apart_point_and_line(skc6,skc5) ),
file('GEO176+2.p',unknown),
[] ).
cnf(16,axiom,
( ~ convergent_lines(u,v)
| ~ apart_point_and_line(w,u)
| distinct_points(w,intersection_point(u,v)) ),
file('GEO176+2.p',unknown),
[] ).
cnf(17,axiom,
( ~ convergent_lines(u,v)
| ~ apart_point_and_line(w,v)
| distinct_points(w,intersection_point(u,v)) ),
file('GEO176+2.p',unknown),
[] ).
cnf(31,plain,
( ~ apart_point_and_line(skc6,skc5)
| ~ convergent_lines(skc4,skc5) ),
inference(res,[status(thm),theory(equality)],[17,6]),
[iquote('0:Res:17.2,6.0')] ).
cnf(32,plain,
( ~ apart_point_and_line(skc6,skc4)
| ~ convergent_lines(skc4,skc5) ),
inference(res,[status(thm),theory(equality)],[16,6]),
[iquote('0:Res:16.2,6.0')] ).
cnf(34,plain,
~ apart_point_and_line(skc6,skc5),
inference(mrr,[status(thm)],[31,2]),
[iquote('0:MRR:31.1,2.0')] ).
cnf(35,plain,
apart_point_and_line(skc6,skc4),
inference(mrr,[status(thm)],[7,34]),
[iquote('0:MRR:7.1,34.0')] ).
cnf(36,plain,
$false,
inference(mrr,[status(thm)],[32,35,2]),
[iquote('0:MRR:32.0,32.1,35.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO176+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 01:41:57 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.43
% 0.19/0.43 SPASS V 3.9
% 0.19/0.43 SPASS beiseite: Proof found.
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43 SPASS derived 14 clauses, backtracked 0 clauses, performed 0 splits and kept 24 clauses.
% 0.19/0.43 SPASS allocated 85141 KBytes.
% 0.19/0.43 SPASS spent 0:00:00.08 on the problem.
% 0.19/0.43 0:00:00.03 for the input.
% 0.19/0.43 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.43 0:00:00.00 for inferences.
% 0.19/0.43 0:00:00.00 for the backtracking.
% 0.19/0.43 0:00:00.00 for the reduction.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Here is a proof with depth 1, length 10 :
% 0.19/0.43 % SZS output start Refutation
% See solution above
% 0.19/0.43 Formulae used in the proof : con con2
% 0.19/0.43
%------------------------------------------------------------------------------