TSTP Solution File: GEO212+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO212+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n009.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:29 EDT 2022
% Result : Theorem 0.21s 0.46s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 24 ( 11 unt; 7 nHn; 24 RR)
% Number of literals : 42 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 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('GEO212+1.p',unknown),
[] ).
cnf(2,axiom,
~ convergent_lines(skc5,skc4),
file('GEO212+1.p',unknown),
[] ).
cnf(3,axiom,
~ unorthogonal_lines(skc3,skc4),
file('GEO212+1.p',unknown),
[] ).
cnf(6,axiom,
~ convergent_lines(u,u),
file('GEO212+1.p',unknown),
[] ).
cnf(9,axiom,
( unorthogonal_lines(u,v)
| convergent_lines(u,v) ),
file('GEO212+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ skP0(u,v)
| convergent_lines(v,u) ),
file('GEO212+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ skP0(u,v)
| unorthogonal_lines(v,u) ),
file('GEO212+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ convergent_lines(u,v)
| convergent_lines(v,w)
| convergent_lines(u,w) ),
file('GEO212+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ skP0(u,v)
| skP0(w,u)
| skP0(w,v) ),
file('GEO212+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ unorthogonal_lines(u,v)
| ~ convergent_lines(u,v)
| skP0(v,u) ),
file('GEO212+1.p',unknown),
[] ).
cnf(29,plain,
( ~ convergent_lines(skc5,skc3)
| skP0(skc3,skc5) ),
inference(res,[status(thm),theory(equality)],[1,25]),
[iquote('0:Res:1.0,25.1')] ).
cnf(30,plain,
~ skP0(skc4,skc3),
inference(res,[status(thm),theory(equality)],[13,3]),
[iquote('0:Res:13.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(38,plain,
~ skP0(skc4,skc5),
inference(res,[status(thm),theory(equality)],[12,2]),
[iquote('0:Res:12.1,2.0')] ).
cnf(39,plain,
( ~ convergent_lines(u,skc5)
| convergent_lines(u,skc4) ),
inference(res,[status(thm),theory(equality)],[16,2]),
[iquote('0:Res:16.2,2.0')] ).
cnf(57,plain,
~ convergent_lines(skc4,skc5),
inference(res,[status(thm),theory(equality)],[39,6]),
[iquote('0:Res:39.1,6.0')] ).
cnf(66,plain,
( ~ convergent_lines(skc5,skc3)
| skP0(u,skc3)
| skP0(u,skc5) ),
inference(res,[status(thm),theory(equality)],[29,24]),
[iquote('0:Res:29.1,24.0')] ).
cnf(67,plain,
( ~ convergent_lines(skc5,skc3)
| skP0(skc4,skc5) ),
inference(res,[status(thm),theory(equality)],[66,30]),
[iquote('0:Res:66.1,30.0')] ).
cnf(71,plain,
~ convergent_lines(skc5,skc3),
inference(mrr,[status(thm)],[67,38]),
[iquote('0:MRR:67.1,38.0')] ).
cnf(105,plain,
( convergent_lines(skc4,u)
| convergent_lines(skc3,u) ),
inference(res,[status(thm),theory(equality)],[31,16]),
[iquote('0:Res:31.0,16.0')] ).
cnf(113,plain,
( convergent_lines(skc4,u)
| convergent_lines(u,v)
| convergent_lines(skc3,v) ),
inference(res,[status(thm),theory(equality)],[105,16]),
[iquote('0:Res:105.1,16.0')] ).
cnf(155,plain,
( convergent_lines(skc4,u)
| convergent_lines(u,skc3) ),
inference(res,[status(thm),theory(equality)],[113,6]),
[iquote('0:Res:113.2,6.0')] ).
cnf(160,plain,
convergent_lines(skc5,skc3),
inference(res,[status(thm),theory(equality)],[155,57]),
[iquote('0:Res:155.0,57.0')] ).
cnf(165,plain,
$false,
inference(mrr,[status(thm)],[160,71]),
[iquote('0:MRR:160.0,71.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO212+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Fri Jun 17 23:59:08 EDT 2022
% 0.14/0.34 % 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 131 clauses, backtracked 0 clauses, performed 0 splits and kept 105 clauses.
% 0.21/0.46 SPASS allocated 85195 KBytes.
% 0.21/0.46 SPASS spent 0:00:00.10 on the problem.
% 0.21/0.46 0:00:00.04 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.01 for the reduction.
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 Here is a proof with depth 5, length 24 :
% 0.21/0.46 % SZS output start Refutation
% See solution above
% 0.21/0.46 Formulae used in the proof : con apart3 occu1 oac1 ax6
% 0.21/0.46
%------------------------------------------------------------------------------