TSTP Solution File: GEO226+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO226+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:10:30 EDT 2023
% Result : Theorem 2.09s 1.15s
% Output : CNFRefutation 2.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 3 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 80 ( 26 ~; 16 |; 29 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn; 24 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',ci4) ).
fof(f19,conjecture,
! [X7,X8] :
( ( convergent_lines(X7,X8)
& line(X8)
& line(X7) )
=> ? [X0] :
( point(X0)
=> ( ~ apart_point_and_line(X0,X8)
& ~ apart_point_and_line(X0,X7) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f20,negated_conjecture,
~ ! [X7,X8] :
( ( convergent_lines(X7,X8)
& line(X8)
& line(X7) )
=> ? [X0] :
( point(X0)
=> ( ~ apart_point_and_line(X0,X8)
& ~ apart_point_and_line(X0,X7) ) ) ),
inference(negated_conjecture,[],[f19]) ).
fof(f26,plain,
~ ! [X0,X1] :
( ( convergent_lines(X0,X1)
& line(X1)
& line(X0) )
=> ? [X2] :
( point(X2)
=> ( ~ apart_point_and_line(X2,X1)
& ~ apart_point_and_line(X2,X0) ) ) ),
inference(rectify,[],[f20]) ).
fof(f35,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f36,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f53,plain,
? [X0,X1] :
( ! [X2] :
( ( apart_point_and_line(X2,X1)
| apart_point_and_line(X2,X0) )
& point(X2) )
& convergent_lines(X0,X1)
& line(X1)
& line(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f54,plain,
? [X0,X1] :
( ! [X2] :
( ( apart_point_and_line(X2,X1)
| apart_point_and_line(X2,X0) )
& point(X2) )
& convergent_lines(X0,X1)
& line(X1)
& line(X0) ),
inference(flattening,[],[f53]) ).
fof(f55,plain,
( ? [X0,X1] :
( ! [X2] :
( ( apart_point_and_line(X2,X1)
| apart_point_and_line(X2,X0) )
& point(X2) )
& convergent_lines(X0,X1)
& line(X1)
& line(X0) )
=> ( ! [X2] :
( ( apart_point_and_line(X2,sK1)
| apart_point_and_line(X2,sK0) )
& point(X2) )
& convergent_lines(sK0,sK1)
& line(sK1)
& line(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f56,plain,
( ! [X2] :
( ( apart_point_and_line(X2,sK1)
| apart_point_and_line(X2,sK0) )
& point(X2) )
& convergent_lines(sK0,sK1)
& line(sK1)
& line(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f54,f55]) ).
fof(f65,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f66,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f77,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f56]) ).
fof(f79,plain,
! [X2] :
( apart_point_and_line(X2,sK1)
| apart_point_and_line(X2,sK0) ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_57,plain,
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_58,plain,
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f66]) ).
cnf(c_67,negated_conjecture,
( apart_point_and_line(X0,sK1)
| apart_point_and_line(X0,sK0) ),
inference(cnf_transformation,[],[f79]) ).
cnf(c_69,negated_conjecture,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f77]) ).
cnf(c_256,plain,
( ~ apart_point_and_line(intersection_point(sK0,sK1),sK0)
| ~ convergent_lines(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_257,plain,
( ~ apart_point_and_line(intersection_point(sK0,sK1),sK1)
| ~ convergent_lines(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_265,plain,
( apart_point_and_line(intersection_point(sK0,sK1),sK1)
| apart_point_and_line(intersection_point(sK0,sK1),sK0) ),
inference(instantiation,[status(thm)],[c_67]) ).
cnf(c_266,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_265,c_257,c_256,c_69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO226+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n013.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 : Tue Aug 29 22:28:46 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.09/1.15 % SZS status Started for theBenchmark.p
% 2.09/1.15 % SZS status Theorem for theBenchmark.p
% 2.09/1.15
% 2.09/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.09/1.15
% 2.09/1.15 ------ iProver source info
% 2.09/1.15
% 2.09/1.15 git: date: 2023-05-31 18:12:56 +0000
% 2.09/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.09/1.15 git: non_committed_changes: false
% 2.09/1.15 git: last_make_outside_of_git: false
% 2.09/1.15
% 2.09/1.15 ------ Parsing...
% 2.09/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.09/1.15
% 2.09/1.15 ------ Preprocessing... sf_s rm: 6 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 2.09/1.15
% 2.09/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.09/1.15 ------ Proving...
% 2.09/1.15 ------ Problem Properties
% 2.09/1.15
% 2.09/1.15
% 2.09/1.15 clauses 16
% 2.09/1.15 conjectures 2
% 2.09/1.15 EPR 12
% 2.09/1.15 Horn 8
% 2.09/1.15 unary 4
% 2.09/1.15 binary 5
% 2.09/1.15 lits 38
% 2.09/1.15 lits eq 0
% 2.09/1.15 fd_pure 0
% 2.09/1.15 fd_pseudo 0
% 2.09/1.15 fd_cond 0
% 2.09/1.15 fd_pseudo_cond 0
% 2.09/1.15 AC symbols 0
% 2.09/1.15
% 2.09/1.15 ------ Schedule dynamic 5 is on
% 2.09/1.15
% 2.09/1.15 ------ no equalities: superposition off
% 2.09/1.15
% 2.09/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.09/1.15
% 2.09/1.15
% 2.09/1.15 ------
% 2.09/1.15 Current options:
% 2.09/1.15 ------
% 2.09/1.15
% 2.09/1.15
% 2.09/1.15
% 2.09/1.15
% 2.09/1.15 ------ Proving...
% 2.09/1.15
% 2.09/1.15
% 2.09/1.15 % SZS status Theorem for theBenchmark.p
% 2.09/1.15
% 2.09/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.09/1.15
% 2.09/1.15
%------------------------------------------------------------------------------