TSTP Solution File: GEO191+3 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GEO191+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n024.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.13s 0.39s
% Output : Proof 0.20s
% 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)
| ~ apart_point_and_line(intersection_point(sK0,sK1),sK1) ),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ci4)]) ).
cnf(g6,plain,
( ~ convergent_lines(sK0,sK1)
| ~ apart_point_and_line(intersection_point(sK0,sK1),sK0) ),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ci3)]) ).
cnf(g7,plain,
( ~ convergent_lines(sK2,sK3)
| ~ apart_point_and_line(intersection_point(sK2,sK3),sK3) ),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ci4)]) ).
cnf(g8,plain,
( ~ convergent_lines(sK2,sK3)
| ~ apart_point_and_line(intersection_point(sK2,sK3),sK2) ),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ci3)]) ).
cnf(g9,plain,
~ convergent_lines(sK0,sK0),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',apart3)]) ).
cnf(g10,plain,
( ~ convergent_lines(sK0,sK1)
| distinct_lines(sK1,sK0)
| convergent_lines(sK0,sK0) ),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ceq3)]) ).
cnf(g11,plain,
( ~ apart_point_and_line(intersection_point(sK0,sK1),sK2)
| distinct_points(intersection_point(sK0,sK1),intersection_point(sK2,sK3))
| apart_point_and_line(intersection_point(sK2,sK3),sK2) ),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ceq1)]) ).
cnf(g12,plain,
( ~ distinct_points(intersection_point(sK0,sK1),intersection_point(sK2,sK3))
| ~ distinct_lines(sK1,sK0)
| apart_point_and_line(intersection_point(sK0,sK1),sK1)
| apart_point_and_line(intersection_point(sK0,sK1),sK0)
| apart_point_and_line(intersection_point(sK2,sK3),sK1)
| apart_point_and_line(intersection_point(sK2,sK3),sK0) ),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',cu1)]) ).
cnf(g13,plain,
( ~ apart_point_and_line(intersection_point(sK0,sK1),sK3)
| distinct_points(intersection_point(sK0,sK1),intersection_point(sK2,sK3))
| apart_point_and_line(intersection_point(sK2,sK3),sK3) ),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ceq1)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO191+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : satcop --statistics %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 06:07:02 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.39 % symbols: 24
% 0.13/0.39 % clauses: 51
% 0.13/0.39 % start clauses: 5
% 0.13/0.39 % iterative deepening steps: 99
% 0.13/0.39 % maximum path limit: 3
% 0.13/0.39 % literal attempts: 45793
% 0.13/0.39 % depth failures: 31305
% 0.13/0.39 % regularity failures: 1988
% 0.13/0.39 % tautology failures: 5355
% 0.13/0.39 % reductions: 4485
% 0.13/0.39 % extensions: 40954
% 0.13/0.39 % SAT variables: 4174
% 0.13/0.39 % SAT clauses: 8725
% 0.13/0.39 % WalkSAT solutions: 8719
% 0.13/0.39 % CDCL solutions: 0
% 0.13/0.39 % SZS status Theorem for theBenchmark
% 0.13/0.39 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------