↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : GEO202+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n015.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:20 EDT 2022

% Result   : Theorem 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   22 (  11 unt;   8 nHn;  22 RR)
%            Number of literals    :   48 (   0 equ;  15 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    distinct_points(skc3,skc5),
    file('GEO202+1.p',unknown),
    [] ).

cnf(2,axiom,
    distinct_points(skc3,skc4),
    file('GEO202+1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ convergent_lines(u,u),
    file('GEO202+1.p',unknown),
    [] ).

cnf(6,axiom,
    convergent_lines(line_connecting(skc3,skc5),line_connecting(skc3,skc4)),
    file('GEO202+1.p',unknown),
    [] ).

cnf(7,axiom,
    distinct_points(intersection_point(line_connecting(skc3,skc5),line_connecting(skc3,skc4)),skc3),
    file('GEO202+1.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ distinct_points(u,v)
    | ~ apart_point_and_line(u,line_connecting(u,v)) ),
    file('GEO202+1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ convergent_lines(u,v)
    | ~ apart_point_and_line(intersection_point(u,v),u) ),
    file('GEO202+1.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ convergent_lines(u,v)
    | ~ apart_point_and_line(intersection_point(u,v),v) ),
    file('GEO202+1.p',unknown),
    [] ).

cnf(17,axiom,
    ( ~ convergent_lines(u,v)
    | distinct_lines(v,w)
    | convergent_lines(u,w) ),
    file('GEO202+1.p',unknown),
    [] ).

cnf(18,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('GEO202+1.p',unknown),
    [] ).

cnf(21,plain,
    ~ apart_point_and_line(skc3,line_connecting(skc3,skc4)),
    inference(res,[status(thm),theory(equality)],[2,11]),
    [iquote('0:Res:2.0,11.0')] ).

cnf(25,plain,
    ~ apart_point_and_line(skc3,line_connecting(skc3,skc5)),
    inference(res,[status(thm),theory(equality)],[1,11]),
    [iquote('0:Res:1.0,11.0')] ).

cnf(30,plain,
    ( distinct_lines(line_connecting(skc3,skc4),u)
    | convergent_lines(line_connecting(skc3,skc5),u) ),
    inference(res,[status(thm),theory(equality)],[6,17]),
    [iquote('0:Res:6.0,17.0')] ).

cnf(31,plain,
    ( ~ distinct_lines(u,v)
    | apart_point_and_line(skc3,u)
    | apart_point_and_line(skc3,v)
    | apart_point_and_line(intersection_point(line_connecting(skc3,skc5),line_connecting(skc3,skc4)),v)
    | apart_point_and_line(intersection_point(line_connecting(skc3,skc5),line_connecting(skc3,skc4)),u) ),
    inference(res,[status(thm),theory(equality)],[7,18]),
    [iquote('0:Res:7.0,18.0')] ).

cnf(212,plain,
    ( convergent_lines(line_connecting(skc3,skc5),u)
    | apart_point_and_line(skc3,line_connecting(skc3,skc4))
    | apart_point_and_line(skc3,u)
    | apart_point_and_line(intersection_point(line_connecting(skc3,skc5),line_connecting(skc3,skc4)),u)
    | apart_point_and_line(intersection_point(line_connecting(skc3,skc5),line_connecting(skc3,skc4)),line_connecting(skc3,skc4)) ),
    inference(res,[status(thm),theory(equality)],[30,31]),
    [iquote('0:Res:30.0,31.0')] ).

cnf(215,plain,
    ( convergent_lines(line_connecting(skc3,skc5),u)
    | apart_point_and_line(skc3,u)
    | apart_point_and_line(intersection_point(line_connecting(skc3,skc5),line_connecting(skc3,skc4)),u)
    | apart_point_and_line(intersection_point(line_connecting(skc3,skc5),line_connecting(skc3,skc4)),line_connecting(skc3,skc4)) ),
    inference(mrr,[status(thm)],[212,21]),
    [iquote('0:MRR:212.1,21.0')] ).

cnf(522,plain,
    ( convergent_lines(line_connecting(skc3,skc5),u)
    | apart_point_and_line(skc3,u)
    | apart_point_and_line(intersection_point(line_connecting(skc3,skc5),line_connecting(skc3,skc4)),u) ),
    inference(spt,[spt(split,[position(s1)])],[215]),
    [iquote('1:Spt:215.0,215.1,215.2')] ).

cnf(526,plain,
    ( ~ convergent_lines(line_connecting(skc3,skc5),line_connecting(skc3,skc4))
    | convergent_lines(line_connecting(skc3,skc5),line_connecting(skc3,skc5))
    | apart_point_and_line(skc3,line_connecting(skc3,skc5)) ),
    inference(res,[status(thm),theory(equality)],[522,13]),
    [iquote('1:Res:522.2,13.1')] ).

cnf(529,plain,
    $false,
    inference(mrr,[status(thm)],[526,6,5,25]),
    [iquote('1:MRR:526.0,526.1,526.2,6.0,5.0,25.0')] ).

cnf(530,plain,
    apart_point_and_line(intersection_point(line_connecting(skc3,skc5),line_connecting(skc3,skc4)),line_connecting(skc3,skc4)),
    inference(spt,[spt(split,[position(s2)])],[215]),
    [iquote('1:Spt:529.0,215.3')] ).

cnf(531,plain,
    ~ convergent_lines(line_connecting(skc3,skc5),line_connecting(skc3,skc4)),
    inference(res,[status(thm),theory(equality)],[530,14]),
    [iquote('1:Res:530.0,14.1')] ).

cnf(534,plain,
    $false,
    inference(mrr,[status(thm)],[531,6]),
    [iquote('1:MRR:531.0,6.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GEO202+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n015.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 21:13:42 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.50  
% 0.20/0.50  SPASS V 3.9 
% 0.20/0.50  SPASS beiseite: Proof found.
% 0.20/0.50  % SZS status Theorem
% 0.20/0.50  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.50  SPASS derived 437 clauses, backtracked 3 clauses, performed 1 splits and kept 242 clauses.
% 0.20/0.50  SPASS allocated 85435 KBytes.
% 0.20/0.50  SPASS spent	0:00:00.14 on the problem.
% 0.20/0.50  		0:00:00.04 for the input.
% 0.20/0.50  		0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.50  		0:00:00.01 for inferences.
% 0.20/0.50  		0:00:00.00 for the backtracking.
% 0.20/0.50  		0:00:00.04 for the reduction.
% 0.20/0.50  
% 0.20/0.50  
% 0.20/0.50  Here is a proof with depth 4, length 22 :
% 0.20/0.50  % SZS output start Refutation
% See solution above
% 0.20/0.50  Formulae used in the proof : con apart3 ci1 ci3 ci4 ceq3 cu1
% 0.20/0.50  
%------------------------------------------------------------------------------