TSTP Solution File: GEO196+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GEO196+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n026.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:26 EDT 2022
% Result : Theorem 0.12s 0.35s
% Output : Proof 0.12s
% 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),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',con)]) ).
cnf(g3,plain,
~ apart_point_and_line(intersection_point(sK0,sK1),sK3),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',con)]) ).
cnf(g4,plain,
( apart_point_and_line(intersection_point(sK2,sK3),sK0)
| 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),sK0) ),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ci3)]) ).
cnf(g6,plain,
( ~ convergent_lines(sK0,sK1)
| ~ apart_point_and_line(intersection_point(sK0,sK1),sK1) ),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ci4)]) ).
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(sK2,sK3)
| distinct_lines(sK3,sK2)
| convergent_lines(sK2,sK2) ),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ceq3)]) ).
cnf(g10,plain,
~ convergent_lines(sK2,sK2),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',apart3)]) ).
cnf(g11,plain,
( ~ apart_point_and_line(intersection_point(sK2,sK3),sK1)
| distinct_points(intersection_point(sK2,sK3),intersection_point(sK0,sK1))
| apart_point_and_line(intersection_point(sK0,sK1),sK1) ),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ceq1)]) ).
cnf(g12,plain,
( ~ distinct_points(intersection_point(sK2,sK3),intersection_point(sK0,sK1))
| ~ distinct_lines(sK3,sK2)
| apart_point_and_line(intersection_point(sK2,sK3),sK3)
| apart_point_and_line(intersection_point(sK2,sK3),sK2)
| apart_point_and_line(intersection_point(sK0,sK1),sK3)
| apart_point_and_line(intersection_point(sK0,sK1),sK2) ),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',cu1)]) ).
cnf(g13,plain,
( ~ apart_point_and_line(intersection_point(sK2,sK3),sK0)
| distinct_points(intersection_point(sK2,sK3),intersection_point(sK0,sK1))
| apart_point_and_line(intersection_point(sK0,sK1),sK0) ),
inference(ground_cnf,[],[file('Axioms/GEO006+0.ax',ceq1)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO196+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n026.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:15:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 % symbols: 12
% 0.12/0.35 % clauses: 19
% 0.12/0.35 % start clauses: 5
% 0.12/0.35 % iterative deepening steps: 69
% 0.12/0.35 % maximum path limit: 3
% 0.12/0.35 % literal attempts: 14000
% 0.12/0.35 % depth failures: 8445
% 0.12/0.35 % regularity failures: 75
% 0.12/0.35 % tautology failures: 3460
% 0.12/0.35 % reductions: 1974
% 0.12/0.35 % extensions: 11712
% 0.12/0.35 % SAT variables: 895
% 0.12/0.35 % SAT clauses: 2287
% 0.12/0.35 % WalkSAT solutions: 2281
% 0.12/0.35 % CDCL solutions: 0
% 0.12/0.35 % SZS status Theorem for theBenchmark
% 0.12/0.35 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------