TSTP Solution File: GEO191+2 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : GEO191+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n018.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:10:22 EDT 2022

% Result   : Theorem 0.21s 0.36s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    convergent_lines(sK0,sK1),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',con)]) ).

cnf(g1,plain,
    convergent_lines(sK2,sK3),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',con)]) ).

cnf(g2,plain,
    ( apart_point_and_line(intersection_point(sK0,sK1),sK2)
    | apart_point_and_line(intersection_point(sK0,sK1),sK3) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',con)]) ).

cnf(g3,plain,
    ~ apart_point_and_line(intersection_point(sK2,sK3),sK0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',con)]) ).

cnf(g4,plain,
    ~ apart_point_and_line(intersection_point(sK2,sK3),sK1),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',con)]) ).

cnf(g5,plain,
    ( ~ convergent_lines(sK0,sK1)
    | distinct_lines(sK0,sK1) ),
    inference(ground_cnf,[],[file('Axioms/GEO008+0.ax',ceq3)]) ).

cnf(g6,plain,
    ( ~ convergent_lines(sK2,sK3)
    | ~ apart_point_and_line(intersection_point(sK0,sK1),sK3)
    | distinct_points(intersection_point(sK0,sK1),intersection_point(sK2,sK3)) ),
    inference(ground_cnf,[],[file('Axioms/GEO008+0.ax',con2)]) ).

cnf(g7,plain,
    ( ~ convergent_lines(sK2,sK3)
    | ~ apart_point_and_line(intersection_point(sK0,sK1),sK2)
    | distinct_points(intersection_point(sK0,sK1),intersection_point(sK2,sK3)) ),
    inference(ground_cnf,[],[file('Axioms/GEO008+0.ax',con2)]) ).

cnf(g8,plain,
    ( ~ convergent_lines(sK0,sK1)
    | ~ apart_point_and_line(intersection_point(sK0,sK1),sK0)
    | distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK1)) ),
    inference(ground_cnf,[],[file('Axioms/GEO008+0.ax',con2)]) ).

cnf(g9,plain,
    ( ~ convergent_lines(sK0,sK1)
    | ~ apart_point_and_line(intersection_point(sK0,sK1),sK1)
    | distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK1)) ),
    inference(ground_cnf,[],[file('Axioms/GEO008+0.ax',con2)]) ).

cnf(g10,plain,
    ~ distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK1)),
    inference(ground_cnf,[],[file('Axioms/GEO008+0.ax',apart1)]) ).

cnf(g11,plain,
    ( ~ distinct_points(intersection_point(sK0,sK1),intersection_point(sK2,sK3))
    | ~ distinct_lines(sK0,sK1)
    | apart_point_and_line(intersection_point(sK0,sK1),sK0)
    | apart_point_and_line(intersection_point(sK0,sK1),sK1)
    | apart_point_and_line(intersection_point(sK2,sK3),sK0)
    | apart_point_and_line(intersection_point(sK2,sK3),sK1) ),
    inference(ground_cnf,[],[file('Axioms/GEO008+0.ax',cu1)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : GEO191+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13  % Command  : satcop --statistics %s
% 0.14/0.34  % Computer : n018.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 : Sat Jun 18 01:40:02 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.21/0.36  % symbols: 12
% 0.21/0.36  % clauses: 19
% 0.21/0.36  % start clauses: 5
% 0.21/0.36  % iterative deepening steps: 66
% 0.21/0.36  % maximum path limit: 3
% 0.21/0.36  % literal attempts: 11464
% 0.21/0.36  % depth failures: 7977
% 0.21/0.36  % regularity failures: 254
% 0.21/0.36  % tautology failures: 1046
% 0.21/0.36  % reductions: 938
% 0.21/0.36  % extensions: 10271
% 0.21/0.36  % SAT variables: 812
% 0.21/0.36  % SAT clauses: 2029
% 0.21/0.36  % WalkSAT solutions: 2025
% 0.21/0.36  % CDCL solutions: 0
% 0.21/0.36  % SZS status Theorem for theBenchmark
% 0.21/0.36  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------