↑ Up

SPASS---3.9.THM-Ref.s

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

% Computer : n028.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:13 EDT 2022

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

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

cnf(3,axiom,
    convergent_lines(skc4,skc3),
    file('GEO193+2.p',unknown),
    [] ).

cnf(4,axiom,
    ~ distinct_points(u,u),
    file('GEO193+2.p',unknown),
    [] ).

cnf(7,axiom,
    apart_point_and_line(intersection_point(skc5,skc3),skc4),
    file('GEO193+2.p',unknown),
    [] ).

cnf(8,axiom,
    ~ apart_point_and_line(intersection_point(skc4,skc3),skc5),
    file('GEO193+2.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ convergent_lines(u,v)
    | distinct_lines(u,v) ),
    file('GEO193+2.p',unknown),
    [] ).

cnf(17,axiom,
    ( ~ convergent_lines(u,v)
    | ~ apart_point_and_line(w,u)
    | distinct_points(w,intersection_point(u,v)) ),
    file('GEO193+2.p',unknown),
    [] ).

cnf(18,axiom,
    ( ~ convergent_lines(u,v)
    | ~ apart_point_and_line(w,v)
    | distinct_points(w,intersection_point(u,v)) ),
    file('GEO193+2.p',unknown),
    [] ).

cnf(19,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('GEO193+2.p',unknown),
    [] ).

cnf(23,plain,
    ( ~ apart_point_and_line(u,skc3)
    | distinct_points(u,intersection_point(skc4,skc3)) ),
    inference(res,[status(thm),theory(equality)],[3,18]),
    [iquote('0:Res:3.0,18.1')] ).

cnf(29,plain,
    distinct_lines(skc5,skc3),
    inference(res,[status(thm),theory(equality)],[1,9]),
    [iquote('0:Res:1.0,9.0')] ).

cnf(30,plain,
    ( ~ apart_point_and_line(u,skc5)
    | distinct_points(u,intersection_point(skc5,skc3)) ),
    inference(res,[status(thm),theory(equality)],[1,17]),
    [iquote('0:Res:1.0,17.1')] ).

cnf(31,plain,
    ( ~ apart_point_and_line(u,skc3)
    | distinct_points(u,intersection_point(skc5,skc3)) ),
    inference(res,[status(thm),theory(equality)],[1,18]),
    [iquote('0:Res:1.0,18.1')] ).

cnf(32,plain,
    ( ~ convergent_lines(skc4,u)
    | distinct_points(intersection_point(skc5,skc3),intersection_point(skc4,u)) ),
    inference(res,[status(thm),theory(equality)],[7,17]),
    [iquote('0:Res:7.0,17.0')] ).

cnf(41,plain,
    ( ~ distinct_points(u,intersection_point(skc4,skc3))
    | ~ distinct_lines(skc5,v)
    | apart_point_and_line(u,v)
    | apart_point_and_line(u,skc5)
    | apart_point_and_line(intersection_point(skc4,skc3),v) ),
    inference(res,[status(thm),theory(equality)],[19,8]),
    [iquote('0:Res:19.5,8.0')] ).

cnf(48,plain,
    ~ apart_point_and_line(intersection_point(skc5,skc3),skc3),
    inference(res,[status(thm),theory(equality)],[31,4]),
    [iquote('0:Res:31.1,4.0')] ).

cnf(66,plain,
    ~ apart_point_and_line(intersection_point(skc5,skc3),skc5),
    inference(res,[status(thm),theory(equality)],[30,4]),
    [iquote('0:Res:30.1,4.0')] ).

cnf(77,plain,
    ~ apart_point_and_line(intersection_point(skc4,skc3),skc3),
    inference(res,[status(thm),theory(equality)],[23,4]),
    [iquote('0:Res:23.1,4.0')] ).

cnf(714,plain,
    ( ~ convergent_lines(skc4,skc3)
    | ~ distinct_lines(skc5,u)
    | apart_point_and_line(intersection_point(skc5,skc3),u)
    | apart_point_and_line(intersection_point(skc5,skc3),skc5)
    | apart_point_and_line(intersection_point(skc4,skc3),u) ),
    inference(res,[status(thm),theory(equality)],[32,41]),
    [iquote('0:Res:32.1,41.0')] ).

cnf(715,plain,
    ( ~ distinct_lines(skc5,u)
    | apart_point_and_line(intersection_point(skc5,skc3),u)
    | apart_point_and_line(intersection_point(skc4,skc3),u) ),
    inference(mrr,[status(thm)],[714,3,66]),
    [iquote('0:MRR:714.0,714.3,3.0,66.0')] ).

cnf(938,plain,
    ( ~ distinct_lines(skc5,skc3)
    | apart_point_and_line(intersection_point(skc5,skc3),skc3) ),
    inference(res,[status(thm),theory(equality)],[715,77]),
    [iquote('0:Res:715.2,77.0')] ).

cnf(954,plain,
    $false,
    inference(mrr,[status(thm)],[938,29,48]),
    [iquote('0:MRR:938.0,938.1,29.0,48.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO193+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Fri Jun 17 18:01:13 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.41/0.58  
% 0.41/0.58  SPASS V 3.9 
% 0.41/0.58  SPASS beiseite: Proof found.
% 0.41/0.58  % SZS status Theorem
% 0.41/0.58  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.41/0.58  SPASS derived 882 clauses, backtracked 0 clauses, performed 0 splits and kept 519 clauses.
% 0.41/0.58  SPASS allocated 85582 KBytes.
% 0.41/0.58  SPASS spent	0:00:00.24 on the problem.
% 0.41/0.58  		0:00:00.03 for the input.
% 0.41/0.58  		0:00:00.03 for the FLOTTER CNF translation.
% 0.41/0.58  		0:00:00.01 for inferences.
% 0.41/0.58  		0:00:00.00 for the backtracking.
% 0.41/0.58  		0:00:00.13 for the reduction.
% 0.41/0.58  
% 0.41/0.58  
% 0.41/0.58  Here is a proof with depth 3, length 22 :
% 0.41/0.58  % SZS output start Refutation
% See solution above
% 0.41/0.58  Formulae used in the proof : con apart1 ceq3 con2 cu1
% 0.41/0.58  
%------------------------------------------------------------------------------