TSTP Solution File: GEO192+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO192+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : 300s
% DateTime : Wed Aug 30 23:10:05 EDT 2023
% Result : Theorem 1.16s 1.17s
% Output : CNFRefutation 1.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 49 ( 13 unt; 0 def)
% Number of atoms : 132 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 143 ( 60 ~; 60 |; 14 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 78 ( 0 sgn; 49 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ distinct_points(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',apart1) ).
fof(f2,axiom,
! [X0] : ~ distinct_lines(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',apart2) ).
fof(f5,axiom,
! [X0,X1,X2] :
( distinct_lines(X0,X1)
=> ( distinct_lines(X1,X2)
| distinct_lines(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',apart5) ).
fof(f8,axiom,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( ( apart_point_and_line(X2,X1)
| apart_point_and_line(X2,X0) )
=> distinct_points(X2,intersection_point(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con2) ).
fof(f11,axiom,
! [X0,X1,X2] :
( apart_point_and_line(X0,X1)
=> ( apart_point_and_line(X0,X2)
| distinct_lines(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ceq2) ).
fof(f13,conjecture,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( apart_point_and_line(intersection_point(X0,X1),X2)
=> ( distinct_lines(X1,X2)
& distinct_lines(X0,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f14,negated_conjecture,
~ ! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( apart_point_and_line(intersection_point(X0,X1),X2)
=> ( distinct_lines(X1,X2)
& distinct_lines(X0,X2) ) ) ),
inference(negated_conjecture,[],[f13]) ).
fof(f18,plain,
! [X0,X1,X2] :
( distinct_lines(X1,X2)
| distinct_lines(X0,X2)
| ~ distinct_lines(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f19,plain,
! [X0,X1,X2] :
( distinct_lines(X1,X2)
| distinct_lines(X0,X2)
| ~ distinct_lines(X0,X1) ),
inference(flattening,[],[f18]) ).
fof(f24,plain,
! [X0,X1,X2] :
( distinct_points(X2,intersection_point(X0,X1))
| ( ~ apart_point_and_line(X2,X1)
& ~ apart_point_and_line(X2,X0) )
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f25,plain,
! [X0,X1,X2] :
( distinct_points(X2,intersection_point(X0,X1))
| ( ~ apart_point_and_line(X2,X1)
& ~ apart_point_and_line(X2,X0) )
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f24]) ).
fof(f30,plain,
! [X0,X1,X2] :
( apart_point_and_line(X0,X2)
| distinct_lines(X1,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f31,plain,
! [X0,X1,X2] :
( apart_point_and_line(X0,X2)
| distinct_lines(X1,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(flattening,[],[f30]) ).
fof(f33,plain,
? [X0,X1,X2] :
( ( ~ distinct_lines(X1,X2)
| ~ distinct_lines(X0,X2) )
& apart_point_and_line(intersection_point(X0,X1),X2)
& convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f34,plain,
? [X0,X1,X2] :
( ( ~ distinct_lines(X1,X2)
| ~ distinct_lines(X0,X2) )
& apart_point_and_line(intersection_point(X0,X1),X2)
& convergent_lines(X0,X1) ),
inference(flattening,[],[f33]) ).
fof(f35,plain,
( ? [X0,X1,X2] :
( ( ~ distinct_lines(X1,X2)
| ~ distinct_lines(X0,X2) )
& apart_point_and_line(intersection_point(X0,X1),X2)
& convergent_lines(X0,X1) )
=> ( ( ~ distinct_lines(sK1,sK2)
| ~ distinct_lines(sK0,sK2) )
& apart_point_and_line(intersection_point(sK0,sK1),sK2)
& convergent_lines(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
( ( ~ distinct_lines(sK1,sK2)
| ~ distinct_lines(sK0,sK2) )
& apart_point_and_line(intersection_point(sK0,sK1),sK2)
& convergent_lines(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f34,f35]) ).
fof(f37,plain,
! [X0] : ~ distinct_points(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f38,plain,
! [X0] : ~ distinct_lines(X0,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f41,plain,
! [X2,X0,X1] :
( distinct_lines(X1,X2)
| distinct_lines(X0,X2)
| ~ distinct_lines(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f45,plain,
! [X2,X0,X1] :
( distinct_points(X2,intersection_point(X0,X1))
| ~ apart_point_and_line(X2,X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f46,plain,
! [X2,X0,X1] :
( distinct_points(X2,intersection_point(X0,X1))
| ~ apart_point_and_line(X2,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f49,plain,
! [X2,X0,X1] :
( apart_point_and_line(X0,X2)
| distinct_lines(X1,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f51,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f36]) ).
fof(f52,plain,
apart_point_and_line(intersection_point(sK0,sK1),sK2),
inference(cnf_transformation,[],[f36]) ).
fof(f53,plain,
( ~ distinct_lines(sK1,sK2)
| ~ distinct_lines(sK0,sK2) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_49,plain,
~ distinct_points(X0,X0),
inference(cnf_transformation,[],[f37]) ).
cnf(c_50,plain,
~ distinct_lines(X0,X0),
inference(cnf_transformation,[],[f38]) ).
cnf(c_53,plain,
( ~ distinct_lines(X0,X1)
| distinct_lines(X0,X2)
| distinct_lines(X1,X2) ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_57,plain,
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(X2,X1)
| distinct_points(X2,intersection_point(X0,X1)) ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_58,plain,
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(X2,X0)
| distinct_points(X2,intersection_point(X0,X1)) ),
inference(cnf_transformation,[],[f45]) ).
cnf(c_61,plain,
( ~ apart_point_and_line(X0,X1)
| distinct_lines(X1,X2)
| apart_point_and_line(X0,X2) ),
inference(cnf_transformation,[],[f49]) ).
cnf(c_63,negated_conjecture,
( ~ distinct_lines(sK1,sK2)
| ~ distinct_lines(sK0,sK2) ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_64,negated_conjecture,
apart_point_and_line(intersection_point(sK0,sK1),sK2),
inference(cnf_transformation,[],[f52]) ).
cnf(c_65,negated_conjecture,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f51]) ).
cnf(c_158,plain,
( ~ apart_point_and_line(intersection_point(sK0,sK1),sK2)
| apart_point_and_line(intersection_point(sK0,sK1),X0)
| distinct_lines(sK2,X0) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_159,plain,
( ~ apart_point_and_line(intersection_point(sK0,sK1),sK2)
| apart_point_and_line(intersection_point(sK0,sK1),sK0)
| distinct_lines(sK2,sK0) ),
inference(instantiation,[status(thm)],[c_158]) ).
cnf(c_160,plain,
( ~ apart_point_and_line(X0,sK1)
| ~ convergent_lines(sK0,sK1)
| distinct_points(X0,intersection_point(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_162,plain,
( ~ apart_point_and_line(X0,sK0)
| ~ convergent_lines(sK0,sK1)
| distinct_points(X0,intersection_point(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_178,plain,
( ~ distinct_lines(sK2,X0)
| distinct_lines(X0,X1)
| distinct_lines(sK2,X1) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_179,plain,
( ~ apart_point_and_line(intersection_point(sK0,sK1),sK1)
| ~ convergent_lines(sK0,sK1)
| distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_160]) ).
cnf(c_180,plain,
~ distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK1)),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_217,plain,
( ~ apart_point_and_line(intersection_point(sK0,sK1),sK0)
| ~ convergent_lines(sK0,sK1)
| distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_162]) ).
cnf(c_218,plain,
( ~ apart_point_and_line(intersection_point(sK0,sK1),sK2)
| apart_point_and_line(intersection_point(sK0,sK1),sK1)
| distinct_lines(sK2,sK1) ),
inference(instantiation,[status(thm)],[c_158]) ).
cnf(c_259,plain,
( ~ distinct_lines(sK2,X0)
| distinct_lines(X0,sK2)
| distinct_lines(sK2,sK2) ),
inference(instantiation,[status(thm)],[c_178]) ).
cnf(c_260,plain,
~ distinct_lines(sK2,sK2),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_261,plain,
( ~ distinct_lines(sK2,sK0)
| distinct_lines(sK2,sK2)
| distinct_lines(sK0,sK2) ),
inference(instantiation,[status(thm)],[c_259]) ).
cnf(c_387,plain,
( ~ distinct_lines(sK2,sK1)
| distinct_lines(sK1,sK2)
| distinct_lines(sK2,sK2) ),
inference(instantiation,[status(thm)],[c_259]) ).
cnf(c_388,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_387,c_260,c_261,c_218,c_217,c_180,c_179,c_159,c_63,c_64,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO192+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n024.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 19:01:23 EDT 2023
% 0.13/0.35 % 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
% 1.16/1.17 % SZS status Started for theBenchmark.p
% 1.16/1.17 % SZS status Theorem for theBenchmark.p
% 1.16/1.17
% 1.16/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.16/1.17
% 1.16/1.17 ------ iProver source info
% 1.16/1.17
% 1.16/1.17 git: date: 2023-05-31 18:12:56 +0000
% 1.16/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.16/1.17 git: non_committed_changes: false
% 1.16/1.17 git: last_make_outside_of_git: false
% 1.16/1.17
% 1.16/1.17 ------ Parsing...
% 1.16/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.16/1.17
% 1.16/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.16/1.17
% 1.16/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.16/1.17 ------ Proving...
% 1.16/1.17 ------ Problem Properties
% 1.16/1.17
% 1.16/1.17
% 1.16/1.17 clauses 17
% 1.16/1.17 conjectures 3
% 1.16/1.17 EPR 12
% 1.16/1.17 Horn 11
% 1.16/1.17 unary 5
% 1.16/1.17 binary 2
% 1.16/1.17 lits 42
% 1.16/1.17 lits eq 0
% 1.16/1.17 fd_pure 0
% 1.16/1.17 fd_pseudo 0
% 1.16/1.17 fd_cond 0
% 1.16/1.17 fd_pseudo_cond 0
% 1.16/1.17 AC symbols 0
% 1.16/1.17
% 1.16/1.17 ------ Schedule dynamic 5 is on
% 1.16/1.17
% 1.16/1.17 ------ no equalities: superposition off
% 1.16/1.17
% 1.16/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.16/1.17
% 1.16/1.17
% 1.16/1.17 ------
% 1.16/1.17 Current options:
% 1.16/1.17 ------
% 1.16/1.17
% 1.16/1.17
% 1.16/1.17
% 1.16/1.17
% 1.16/1.17 ------ Proving...
% 1.16/1.17
% 1.16/1.17
% 1.16/1.17 % SZS status Theorem for theBenchmark.p
% 1.16/1.17
% 1.16/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.16/1.17
% 1.16/1.17
%------------------------------------------------------------------------------