TSTP Solution File: GEO203+3 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : GEO203+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n008.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:32 EDT 2022

% Result   : Theorem 0.13s 0.35s
% Output   : Proof 0.13s
% 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(sK0,sK2),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',con)]) ).

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

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

cnf(g4,plain,
    ( ~ convergent_lines(sK0,sK1)
    | ~ apart_point_and_line(intersection_point(sK0,sK1),sK0) ),
    inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ci3)]) ).

cnf(g5,plain,
    ( ~ convergent_lines(sK0,sK2)
    | ~ apart_point_and_line(intersection_point(sK0,sK2),sK0) ),
    inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ci3)]) ).

cnf(g6,plain,
    ( ~ distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2))
    | ~ apart_point_and_line(intersection_point(sK0,sK2),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))) ),
    inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ci2)]) ).

cnf(g7,plain,
    ( ~ distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2))
    | ~ apart_point_and_line(intersection_point(sK0,sK1),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))) ),
    inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ci1)]) ).

cnf(g8,plain,
    ( distinct_lines(line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),sK0)
    | equal_lines(line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),sK0) ),
    inference(ground_cnf,[],[file('Axioms/GEO006+6.ax',ax2)]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : GEO203+3 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n008.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 18:46:22 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  % symbols: 23
% 0.13/0.35  % clauses: 50
% 0.13/0.35  % start clauses: 4
% 0.13/0.35  % iterative deepening steps: 24
% 0.13/0.35  % maximum path limit: 2
% 0.13/0.35  % literal attempts: 2758
% 0.13/0.35  % depth failures: 2060
% 0.13/0.35  % regularity failures: 116
% 0.13/0.35  % tautology failures: 114
% 0.13/0.35  % reductions: 168
% 0.13/0.35  % extensions: 2506
% 0.13/0.35  % SAT variables: 713
% 0.13/0.35  % SAT clauses: 1243
% 0.13/0.35  % WalkSAT solutions: 1236
% 0.13/0.35  % CDCL solutions: 0
% 0.13/0.35  % SZS status Theorem for theBenchmark
% 0.13/0.35  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------