TSTP Solution File: GEO176+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO176+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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 : Wed Aug 30 23:09:53 EDT 2023
% Result : Theorem 1.83s 1.17s
% Output : CNFRefutation 1.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 5 unt; 0 def)
% Number of atoms : 96 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 98 ( 35 ~; 35 |; 21 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn; 36 !; 12 ?)
% 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(f36,conjecture,
! [X0,X1,X3,X4] :
( ( ( apart_point_and_line(X0,X4)
| apart_point_and_line(X0,X3) )
& convergent_lines(X3,X4)
& distinct_points(X0,X1) )
=> distinct_points(X0,intersection_point(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f37,negated_conjecture,
~ ! [X0,X1,X3,X4] :
( ( ( apart_point_and_line(X0,X4)
| apart_point_and_line(X0,X3) )
& convergent_lines(X3,X4)
& distinct_points(X0,X1) )
=> distinct_points(X0,intersection_point(X3,X4)) ),
inference(negated_conjecture,[],[f36]) ).
fof(f51,plain,
~ ! [X0,X1,X2,X3] :
( ( ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& convergent_lines(X2,X3)
& distinct_points(X0,X1) )
=> distinct_points(X0,intersection_point(X2,X3)) ),
inference(rectify,[],[f37]) ).
fof(f60,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f61,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f64,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(f65,plain,
! [X0,X1,X2] :
( apart_point_and_line(X2,X1)
| distinct_points(X0,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(flattening,[],[f64]) ).
fof(f90,plain,
? [X0,X1,X2,X3] :
( ~ distinct_points(X0,intersection_point(X2,X3))
& ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& convergent_lines(X2,X3)
& distinct_points(X0,X1) ),
inference(ennf_transformation,[],[f51]) ).
fof(f91,plain,
? [X0,X1,X2,X3] :
( ~ distinct_points(X0,intersection_point(X2,X3))
& ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& convergent_lines(X2,X3)
& distinct_points(X0,X1) ),
inference(flattening,[],[f90]) ).
fof(f92,plain,
( ? [X0,X1,X2,X3] :
( ~ distinct_points(X0,intersection_point(X2,X3))
& ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& convergent_lines(X2,X3)
& distinct_points(X0,X1) )
=> ( ~ distinct_points(sK0,intersection_point(sK2,sK3))
& ( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) )
& convergent_lines(sK2,sK3)
& distinct_points(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f93,plain,
( ~ distinct_points(sK0,intersection_point(sK2,sK3))
& ( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) )
& convergent_lines(sK2,sK3)
& distinct_points(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f91,f92]) ).
fof(f102,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f103,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f105,plain,
! [X2,X0,X1] :
( apart_point_and_line(X2,X1)
| distinct_points(X0,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(cnf_transformation,[],[f65]) ).
fof(f131,plain,
convergent_lines(sK2,sK3),
inference(cnf_transformation,[],[f93]) ).
fof(f132,plain,
( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) ),
inference(cnf_transformation,[],[f93]) ).
fof(f133,plain,
~ distinct_points(sK0,intersection_point(sK2,sK3)),
inference(cnf_transformation,[],[f93]) ).
cnf(c_57,plain,
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
cnf(c_58,plain,
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
cnf(c_60,plain,
( ~ apart_point_and_line(X0,X1)
| distinct_points(X0,X2)
| apart_point_and_line(X2,X1) ),
inference(cnf_transformation,[],[f105]) ).
cnf(c_85,negated_conjecture,
~ distinct_points(sK0,intersection_point(sK2,sK3)),
inference(cnf_transformation,[],[f133]) ).
cnf(c_86,negated_conjecture,
( apart_point_and_line(sK0,sK2)
| apart_point_and_line(sK0,sK3) ),
inference(cnf_transformation,[],[f132]) ).
cnf(c_87,negated_conjecture,
convergent_lines(sK2,sK3),
inference(cnf_transformation,[],[f131]) ).
cnf(c_455,plain,
( ~ apart_point_and_line(intersection_point(sK2,sK3),sK2)
| ~ convergent_lines(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_456,plain,
( ~ apart_point_and_line(intersection_point(sK2,sK3),sK3)
| ~ convergent_lines(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_537,plain,
( ~ apart_point_and_line(X0,sK2)
| distinct_points(X0,intersection_point(sK2,sK3))
| apart_point_and_line(intersection_point(sK2,sK3),sK2) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_538,plain,
( ~ apart_point_and_line(sK0,sK2)
| distinct_points(sK0,intersection_point(sK2,sK3))
| apart_point_and_line(intersection_point(sK2,sK3),sK2) ),
inference(instantiation,[status(thm)],[c_537]) ).
cnf(c_539,plain,
( ~ apart_point_and_line(X0,sK3)
| distinct_points(X0,intersection_point(sK2,sK3))
| apart_point_and_line(intersection_point(sK2,sK3),sK3) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_540,plain,
( ~ apart_point_and_line(sK0,sK3)
| distinct_points(sK0,intersection_point(sK2,sK3))
| apart_point_and_line(intersection_point(sK2,sK3),sK3) ),
inference(instantiation,[status(thm)],[c_539]) ).
cnf(c_541,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_540,c_538,c_456,c_455,c_85,c_86,c_87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GEO176+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 20:36:11 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.83/1.17 % SZS status Started for theBenchmark.p
% 1.83/1.17 % SZS status Theorem for theBenchmark.p
% 1.83/1.17
% 1.83/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.83/1.17
% 1.83/1.17 ------ iProver source info
% 1.83/1.17
% 1.83/1.17 git: date: 2023-05-31 18:12:56 +0000
% 1.83/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.83/1.17 git: non_committed_changes: false
% 1.83/1.17 git: last_make_outside_of_git: false
% 1.83/1.17
% 1.83/1.17 ------ Parsing...
% 1.83/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.83/1.17
% 1.83/1.17 ------ Preprocessing... sf_s rm: 4 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.83/1.17
% 1.83/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.83/1.17 ------ Proving...
% 1.83/1.17 ------ Problem Properties
% 1.83/1.17
% 1.83/1.17
% 1.83/1.17 clauses 32
% 1.83/1.17 conjectures 4
% 1.83/1.17 EPR 23
% 1.83/1.17 Horn 15
% 1.83/1.17 unary 10
% 1.83/1.17 binary 7
% 1.83/1.17 lits 80
% 1.83/1.17 lits eq 0
% 1.83/1.17 fd_pure 0
% 1.83/1.17 fd_pseudo 0
% 1.83/1.17 fd_cond 0
% 1.83/1.17 fd_pseudo_cond 0
% 1.83/1.17 AC symbols 0
% 1.83/1.17
% 1.83/1.17 ------ Schedule dynamic 5 is on
% 1.83/1.17
% 1.83/1.17 ------ no equalities: superposition off
% 1.83/1.17
% 1.83/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.83/1.17
% 1.83/1.17
% 1.83/1.17 ------
% 1.83/1.17 Current options:
% 1.83/1.17 ------
% 1.83/1.17
% 1.83/1.17
% 1.83/1.17
% 1.83/1.17
% 1.83/1.17 ------ Proving...
% 1.83/1.17
% 1.83/1.17
% 1.83/1.17 % SZS status Theorem for theBenchmark.p
% 1.83/1.17
% 1.83/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.83/1.17
% 1.83/1.17
%------------------------------------------------------------------------------