TSTP Solution File: GEO200+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO200+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n008.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.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 9 unt; 6 nHn; 18 RR)
% Number of literals : 37 ( 0 equ; 13 neg)
% Maximal clause size : 6 ( 2 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(1,axiom,
distinct_points(skc2,skc3),
file('GEO200+1.p',unknown),
[] ).
cnf(2,axiom,
~ distinct_points(u,u),
file('GEO200+1.p',unknown),
[] ).
cnf(5,axiom,
distinct_lines(line_connecting(skc2,skc3),line_connecting(skc3,skc2)),
file('GEO200+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ distinct_points(u,v)
| distinct_points(v,w)
| distinct_points(u,w) ),
file('GEO200+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ distinct_points(u,v)
| ~ apart_point_and_line(u,line_connecting(u,v)) ),
file('GEO200+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ distinct_points(u,v)
| ~ apart_point_and_line(v,line_connecting(u,v)) ),
file('GEO200+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ distinct_lines(u,v)
| ~ distinct_points(w,x)
| apart_point_and_line(x,u)
| apart_point_and_line(x,v)
| apart_point_and_line(w,v)
| apart_point_and_line(w,u) ),
file('GEO200+1.p',unknown),
[] ).
cnf(17,plain,
( ~ distinct_lines(u,v)
| apart_point_and_line(skc3,u)
| apart_point_and_line(skc3,v)
| apart_point_and_line(skc2,v)
| apart_point_and_line(skc2,u) ),
inference(res,[status(thm),theory(equality)],[1,16]),
[iquote('0:Res:1.0,16.0')] ).
cnf(18,plain,
( distinct_points(skc3,u)
| distinct_points(skc2,u) ),
inference(res,[status(thm),theory(equality)],[1,6]),
[iquote('0:Res:1.0,6.0')] ).
cnf(19,plain,
~ apart_point_and_line(skc2,line_connecting(skc2,skc3)),
inference(res,[status(thm),theory(equality)],[1,9]),
[iquote('0:Res:1.0,9.0')] ).
cnf(20,plain,
~ apart_point_and_line(skc3,line_connecting(skc2,skc3)),
inference(res,[status(thm),theory(equality)],[1,10]),
[iquote('0:Res:1.0,10.0')] ).
cnf(24,plain,
( apart_point_and_line(skc2,line_connecting(skc2,skc3))
| apart_point_and_line(skc2,line_connecting(skc3,skc2))
| apart_point_and_line(skc3,line_connecting(skc3,skc2))
| apart_point_and_line(skc3,line_connecting(skc2,skc3)) ),
inference(res,[status(thm),theory(equality)],[5,17]),
[iquote('0:Res:5.0,17.0')] ).
cnf(25,plain,
( apart_point_and_line(skc3,line_connecting(skc3,skc2))
| apart_point_and_line(skc2,line_connecting(skc3,skc2)) ),
inference(mrr,[status(thm)],[24,19,20]),
[iquote('0:MRR:24.0,24.3,19.0,20.0')] ).
cnf(26,plain,
distinct_points(skc3,skc2),
inference(res,[status(thm),theory(equality)],[18,2]),
[iquote('0:Res:18.1,2.0')] ).
cnf(28,plain,
( ~ distinct_points(skc3,skc2)
| apart_point_and_line(skc3,line_connecting(skc3,skc2)) ),
inference(res,[status(thm),theory(equality)],[25,10]),
[iquote('0:Res:25.1,10.1')] ).
cnf(29,plain,
apart_point_and_line(skc3,line_connecting(skc3,skc2)),
inference(mrr,[status(thm)],[28,26]),
[iquote('0:MRR:28.0,26.0')] ).
cnf(30,plain,
~ distinct_points(skc3,skc2),
inference(res,[status(thm),theory(equality)],[29,9]),
[iquote('0:Res:29.0,9.1')] ).
cnf(31,plain,
$false,
inference(mrr,[status(thm)],[30,26]),
[iquote('0:MRR:30.0,26.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO200+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n008.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 : Fri Jun 17 15:35:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 12 clauses, backtracked 0 clauses, performed 0 splits and kept 27 clauses.
% 0.19/0.44 SPASS allocated 85195 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.08 on the problem.
% 0.19/0.44 0:00:00.03 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.00 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 4, length 18 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : con apart1 apart4 ci1 ci2 cu1
% 0.19/0.44
%------------------------------------------------------------------------------