TSTP Solution File: GEO185+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GEO185+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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 : 300s
% DateTime : Mon Jun 24 06:13:34 EDT 2024
% Result : Theorem 2.20s 1.18s
% Output : CNFRefutation 2.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ci3) ).
fof(f10,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ci4) ).
fof(f12,axiom,
! [X0,X1,X2] :
( apart_point_and_line(X0,X1)
=> ( apart_point_and_line(X2,X1)
| distinct_points(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ceq1) ).
fof(f15,conjecture,
! [X0,X1,X3,X4] :
( ( ~ distinct_points(X0,intersection_point(X3,X4))
& convergent_lines(X3,X4)
& distinct_points(X0,X1) )
=> ( ~ apart_point_and_line(X0,X4)
& ~ apart_point_and_line(X0,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f16,negated_conjecture,
~ ! [X0,X1,X3,X4] :
( ( ~ distinct_points(X0,intersection_point(X3,X4))
& convergent_lines(X3,X4)
& distinct_points(X0,X1) )
=> ( ~ apart_point_and_line(X0,X4)
& ~ apart_point_and_line(X0,X3) ) ),
inference(negated_conjecture,[],[f15]) ).
fof(f18,plain,
~ ! [X0,X1,X2,X3] :
( ( ~ distinct_points(X0,intersection_point(X2,X3))
& convergent_lines(X2,X3)
& distinct_points(X0,X1) )
=> ( ~ apart_point_and_line(X0,X3)
& ~ apart_point_and_line(X0,X2) ) ),
inference(rectify,[],[f16]) ).
fof(f27,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f28,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f31,plain,
! [X0,X1,X2] :
( apart_point_and_line(X2,X1)
| distinct_points(X0,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f32,plain,
! [X0,X1,X2] :
( apart_point_and_line(X2,X1)
| distinct_points(X0,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(flattening,[],[f31]) ).
fof(f37,plain,
? [X0,X1,X2,X3] :
( ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& ~ distinct_points(X0,intersection_point(X2,X3))
& convergent_lines(X2,X3)
& distinct_points(X0,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f38,plain,
? [X0,X1,X2,X3] :
( ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& ~ distinct_points(X0,intersection_point(X2,X3))
& convergent_lines(X2,X3)
& distinct_points(X0,X1) ),
inference(flattening,[],[f37]) ).
fof(f39,plain,
( ? [X0,X1,X2,X3] :
( ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& ~ distinct_points(X0,intersection_point(X2,X3))
& convergent_lines(X2,X3)
& distinct_points(X0,X1) )
=> ( ( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) )
& ~ distinct_points(sK0,intersection_point(sK2,sK3))
& convergent_lines(sK2,sK3)
& distinct_points(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
( ( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) )
& ~ distinct_points(sK0,intersection_point(sK2,sK3))
& convergent_lines(sK2,sK3)
& distinct_points(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f38,f39]) ).
fof(f49,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f50,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f52,plain,
! [X2,X0,X1] :
( apart_point_and_line(X2,X1)
| distinct_points(X0,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f56,plain,
convergent_lines(sK2,sK3),
inference(cnf_transformation,[],[f40]) ).
fof(f57,plain,
~ distinct_points(sK0,intersection_point(sK2,sK3)),
inference(cnf_transformation,[],[f40]) ).
fof(f58,plain,
( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_57,plain,
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f49]) ).
cnf(c_58,plain,
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f50]) ).
cnf(c_60,plain,
( ~ apart_point_and_line(X0,X1)
| distinct_points(X0,X2)
| apart_point_and_line(X2,X1) ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_63,negated_conjecture,
( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) ),
inference(cnf_transformation,[],[f58]) ).
cnf(c_64,negated_conjecture,
~ distinct_points(sK0,intersection_point(sK2,sK3)),
inference(cnf_transformation,[],[f57]) ).
cnf(c_65,negated_conjecture,
convergent_lines(sK2,sK3),
inference(cnf_transformation,[],[f56]) ).
cnf(c_150,plain,
intersection_point(sK2,sK3) = sP0_iProver_def,
definition ).
cnf(c_152,negated_conjecture,
convergent_lines(sK2,sK3),
inference(demodulation,[status(thm)],[c_65]) ).
cnf(c_153,negated_conjecture,
~ distinct_points(sK0,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_64,c_150]) ).
cnf(c_154,negated_conjecture,
( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) ),
inference(demodulation,[status(thm)],[c_63]) ).
cnf(c_666,plain,
( ~ convergent_lines(sK2,sK3)
| ~ apart_point_and_line(sP0_iProver_def,sK2) ),
inference(superposition,[status(thm)],[c_150,c_57]) ).
cnf(c_667,plain,
~ apart_point_and_line(sP0_iProver_def,sK2),
inference(forward_subsumption_resolution,[status(thm)],[c_666,c_152]) ).
cnf(c_673,plain,
( ~ convergent_lines(sK2,sK3)
| ~ apart_point_and_line(sP0_iProver_def,sK3) ),
inference(superposition,[status(thm)],[c_150,c_58]) ).
cnf(c_674,plain,
~ apart_point_and_line(sP0_iProver_def,sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_673,c_152]) ).
cnf(c_681,plain,
( distinct_points(sK0,X0)
| apart_point_and_line(X0,sK2)
| apart_point_and_line(sK0,sK3) ),
inference(superposition,[status(thm)],[c_154,c_60]) ).
cnf(c_761,plain,
( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sP0_iProver_def,sK2) ),
inference(superposition,[status(thm)],[c_681,c_153]) ).
cnf(c_762,plain,
apart_point_and_line(sK0,sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_761,c_667]) ).
cnf(c_766,plain,
( distinct_points(sK0,X0)
| apart_point_and_line(X0,sK3) ),
inference(superposition,[status(thm)],[c_762,c_60]) ).
cnf(c_827,plain,
apart_point_and_line(sP0_iProver_def,sK3),
inference(superposition,[status(thm)],[c_766,c_153]) ).
cnf(c_828,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_827,c_674]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GEO185+1 : TPTP v8.2.0. Released v3.3.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n025.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 : 300
% 0.13/0.34 % DateTime : Fri Jun 21 10:26:39 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.20/1.18 % SZS status Started for theBenchmark.p
% 2.20/1.18 % SZS status Theorem for theBenchmark.p
% 2.20/1.18
% 2.20/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.20/1.18
% 2.20/1.18 ------ iProver source info
% 2.20/1.18
% 2.20/1.18 git: date: 2024-06-12 09:56:46 +0000
% 2.20/1.18 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 2.20/1.18 git: non_committed_changes: false
% 2.20/1.18
% 2.20/1.18 ------ Parsing...
% 2.20/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.20/1.18
% 2.20/1.18 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 2.20/1.18
% 2.20/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.20/1.18
% 2.20/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.20/1.18 ------ Proving...
% 2.20/1.18 ------ Problem Properties
% 2.20/1.18
% 2.20/1.18
% 2.20/1.18 clauses 19
% 2.20/1.18 conjectures 4
% 2.20/1.18 EPR 14
% 2.20/1.18 Horn 11
% 2.20/1.18 unary 7
% 2.20/1.18 binary 5
% 2.20/1.18 lits 41
% 2.20/1.18 lits eq 1
% 2.20/1.18 fd_pure 0
% 2.20/1.18 fd_pseudo 0
% 2.20/1.18 fd_cond 0
% 2.20/1.18 fd_pseudo_cond 0
% 2.20/1.18 AC symbols 0
% 2.20/1.18
% 2.20/1.18 ------ Schedule dynamic 5 is on
% 2.20/1.18
% 2.20/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.20/1.18
% 2.20/1.18
% 2.20/1.18 ------
% 2.20/1.18 Current options:
% 2.20/1.18 ------
% 2.20/1.18
% 2.20/1.18
% 2.20/1.18
% 2.20/1.18
% 2.20/1.18 ------ Proving...
% 2.20/1.18
% 2.20/1.18
% 2.20/1.18 % SZS status Theorem for theBenchmark.p
% 2.20/1.18
% 2.20/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.20/1.18
% 2.20/1.18
%------------------------------------------------------------------------------