TSTP Solution File: GEO213+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO213+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:30 EDT 2022
% Result : Theorem 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 29 ( 12 unt; 9 nHn; 29 RR)
% Number of literals : 52 ( 0 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
unorthogonal_lines(skc5,skc3),
file('GEO213+2.p',unknown),
[] ).
cnf(2,axiom,
~ distinct_lines(skc5,skc4),
file('GEO213+2.p',unknown),
[] ).
cnf(3,axiom,
~ unorthogonal_lines(skc3,skc4),
file('GEO213+2.p',unknown),
[] ).
cnf(5,axiom,
~ distinct_lines(u,u),
file('GEO213+2.p',unknown),
[] ).
cnf(6,axiom,
~ convergent_lines(u,u),
file('GEO213+2.p',unknown),
[] ).
cnf(9,axiom,
( unorthogonal_lines(u,v)
| convergent_lines(u,v) ),
file('GEO213+2.p',unknown),
[] ).
cnf(12,axiom,
( ~ convergent_lines(u,v)
| distinct_lines(u,v) ),
file('GEO213+2.p',unknown),
[] ).
cnf(13,axiom,
( ~ skP0(u,v)
| convergent_lines(v,u) ),
file('GEO213+2.p',unknown),
[] ).
cnf(14,axiom,
( ~ skP0(u,v)
| unorthogonal_lines(v,u) ),
file('GEO213+2.p',unknown),
[] ).
cnf(16,axiom,
( ~ distinct_lines(u,v)
| distinct_lines(v,w)
| distinct_lines(u,w) ),
file('GEO213+2.p',unknown),
[] ).
cnf(17,axiom,
( ~ convergent_lines(u,v)
| convergent_lines(v,w)
| convergent_lines(u,w) ),
file('GEO213+2.p',unknown),
[] ).
cnf(20,axiom,
( ~ skP0(u,v)
| skP0(w,u)
| skP0(w,v) ),
file('GEO213+2.p',unknown),
[] ).
cnf(21,axiom,
( ~ unorthogonal_lines(u,v)
| ~ convergent_lines(u,v)
| skP0(v,u) ),
file('GEO213+2.p',unknown),
[] ).
cnf(29,plain,
( ~ convergent_lines(skc5,skc3)
| skP0(skc3,skc5) ),
inference(res,[status(thm),theory(equality)],[1,21]),
[iquote('0:Res:1.0,21.1')] ).
cnf(30,plain,
~ skP0(skc4,skc3),
inference(res,[status(thm),theory(equality)],[14,3]),
[iquote('0:Res:14.1,3.0')] ).
cnf(31,plain,
convergent_lines(skc3,skc4),
inference(res,[status(thm),theory(equality)],[9,3]),
[iquote('0:Res:9.1,3.0')] ).
cnf(34,plain,
~ convergent_lines(skc5,skc4),
inference(res,[status(thm),theory(equality)],[12,2]),
[iquote('0:Res:12.1,2.0')] ).
cnf(36,plain,
( ~ distinct_lines(u,skc5)
| distinct_lines(u,skc4) ),
inference(res,[status(thm),theory(equality)],[16,2]),
[iquote('0:Res:16.2,2.0')] ).
cnf(50,plain,
~ distinct_lines(skc4,skc5),
inference(res,[status(thm),theory(equality)],[36,5]),
[iquote('0:Res:36.1,5.0')] ).
cnf(61,plain,
( ~ convergent_lines(skc5,skc3)
| skP0(u,skc3)
| skP0(u,skc5) ),
inference(res,[status(thm),theory(equality)],[29,20]),
[iquote('0:Res:29.1,20.0')] ).
cnf(62,plain,
( ~ convergent_lines(skc5,skc3)
| skP0(skc4,skc5) ),
inference(res,[status(thm),theory(equality)],[61,30]),
[iquote('0:Res:61.1,30.0')] ).
cnf(67,plain,
( ~ convergent_lines(skc5,skc3)
| convergent_lines(skc5,skc4) ),
inference(res,[status(thm),theory(equality)],[62,13]),
[iquote('0:Res:62.1,13.0')] ).
cnf(69,plain,
~ convergent_lines(skc5,skc3),
inference(mrr,[status(thm)],[67,34]),
[iquote('0:MRR:67.1,34.0')] ).
cnf(72,plain,
( convergent_lines(skc4,u)
| convergent_lines(skc3,u) ),
inference(res,[status(thm),theory(equality)],[31,17]),
[iquote('0:Res:31.0,17.0')] ).
cnf(75,plain,
( convergent_lines(skc4,u)
| convergent_lines(u,v)
| convergent_lines(skc3,v) ),
inference(res,[status(thm),theory(equality)],[72,17]),
[iquote('0:Res:72.1,17.0')] ).
cnf(96,plain,
( convergent_lines(skc4,u)
| convergent_lines(u,skc3) ),
inference(res,[status(thm),theory(equality)],[75,6]),
[iquote('0:Res:75.2,6.0')] ).
cnf(101,plain,
( convergent_lines(u,skc3)
| distinct_lines(skc4,u) ),
inference(res,[status(thm),theory(equality)],[96,12]),
[iquote('0:Res:96.0,12.0')] ).
cnf(113,plain,
distinct_lines(skc4,skc5),
inference(res,[status(thm),theory(equality)],[101,69]),
[iquote('0:Res:101.0,69.0')] ).
cnf(114,plain,
$false,
inference(mrr,[status(thm)],[113,50]),
[iquote('0:MRR:113.0,50.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GEO213+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 13:52:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46
% 0.20/0.46 SPASS V 3.9
% 0.20/0.46 SPASS beiseite: Proof found.
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 SPASS derived 82 clauses, backtracked 0 clauses, performed 0 splits and kept 82 clauses.
% 0.20/0.46 SPASS allocated 85198 KBytes.
% 0.20/0.46 SPASS spent 0:00:00.10 on the problem.
% 0.20/0.46 0:00:00.04 for the input.
% 0.20/0.46 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.46 0:00:00.00 for inferences.
% 0.20/0.46 0:00:00.00 for the backtracking.
% 0.20/0.46 0:00:00.00 for the reduction.
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Here is a proof with depth 6, length 29 :
% 0.20/0.46 % SZS output start Refutation
% See solution above
% 0.20/0.46 Formulae used in the proof : con apart2 apart3 occu1 ceq3 oac1 apart5 apart6
% 0.20/0.46
%------------------------------------------------------------------------------