TSTP Solution File: GEO224+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GEO224+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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 : Fri May 3 02:17:06 EDT 2024
% Result : Theorem 0.46s 1.14s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 66 ( 13 unt; 0 def)
% Number of atoms : 165 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 179 ( 80 ~; 62 |; 24 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 122 ( 9 sgn 80 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( convergent_lines(X1,X2)
| convergent_lines(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).
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(f21,axiom,
! [X8,X5] : ~ unorthogonal_lines(orthogonal_through_point(X5,X8),X5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ooc1) ).
fof(f24,axiom,
! [X5,X6] :
~ ( ~ unorthogonal_lines(X5,X6)
& ~ convergent_lines(X5,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',coipo1) ).
fof(f28,axiom,
! [X5,X6] :
( ( convergent_lines(X5,X6)
& line(X6)
& line(X5) )
=> point(intersection_point(X5,X6)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int1) ).
fof(f29,axiom,
! [X5,X8] :
( ( point(X8)
& line(X5) )
=> line(parallel_through_point(X5,X8)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',par1) ).
fof(f30,axiom,
! [X5,X8] :
( ( point(X8)
& line(X5) )
=> line(orthogonal_through_point(X5,X8)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',orth1) ).
fof(f34,axiom,
! [X0,X1] :
( incident_point_and_line(X0,X1)
<=> ~ apart_point_and_line(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a4) ).
fof(f36,conjecture,
! [X0,X1] :
( ( line(X1)
& point(X0) )
=> ? [X2] :
( incident_point_and_line(X2,X1)
& point(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f37,negated_conjecture,
~ ! [X0,X1] :
( ( line(X1)
& point(X0) )
=> ? [X2] :
( incident_point_and_line(X2,X1)
& point(X2) ) ),
inference(negated_conjecture,[],[f36]) ).
fof(f41,plain,
! [X0,X1] : ~ unorthogonal_lines(orthogonal_through_point(X1,X0),X1),
inference(rectify,[],[f21]) ).
fof(f44,plain,
! [X0,X1] :
~ ( ~ unorthogonal_lines(X0,X1)
& ~ convergent_lines(X0,X1) ),
inference(rectify,[],[f24]) ).
fof(f48,plain,
! [X0,X1] :
( ( convergent_lines(X0,X1)
& line(X1)
& line(X0) )
=> point(intersection_point(X0,X1)) ),
inference(rectify,[],[f28]) ).
fof(f49,plain,
! [X0,X1] :
( ( point(X1)
& line(X0) )
=> line(parallel_through_point(X0,X1)) ),
inference(rectify,[],[f29]) ).
fof(f50,plain,
! [X0,X1] :
( ( point(X1)
& line(X0) )
=> line(orthogonal_through_point(X0,X1)) ),
inference(rectify,[],[f30]) ).
fof(f51,plain,
! [X0,X1] :
( ~ apart_point_and_line(X0,X1)
=> incident_point_and_line(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f34]) ).
fof(f56,plain,
! [X0,X1,X2] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f57,plain,
! [X0,X1,X2] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f56]) ).
fof(f61,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f77,plain,
! [X0,X1] :
( unorthogonal_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f44]) ).
fof(f84,plain,
! [X0,X1] :
( point(intersection_point(X0,X1))
| ~ convergent_lines(X0,X1)
| ~ line(X1)
| ~ line(X0) ),
inference(ennf_transformation,[],[f48]) ).
fof(f85,plain,
! [X0,X1] :
( point(intersection_point(X0,X1))
| ~ convergent_lines(X0,X1)
| ~ line(X1)
| ~ line(X0) ),
inference(flattening,[],[f84]) ).
fof(f86,plain,
! [X0,X1] :
( line(parallel_through_point(X0,X1))
| ~ point(X1)
| ~ line(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f87,plain,
! [X0,X1] :
( line(parallel_through_point(X0,X1))
| ~ point(X1)
| ~ line(X0) ),
inference(flattening,[],[f86]) ).
fof(f88,plain,
! [X0,X1] :
( line(orthogonal_through_point(X0,X1))
| ~ point(X1)
| ~ line(X0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f89,plain,
! [X0,X1] :
( line(orthogonal_through_point(X0,X1))
| ~ point(X1)
| ~ line(X0) ),
inference(flattening,[],[f88]) ).
fof(f90,plain,
! [X0,X1] :
( incident_point_and_line(X0,X1)
| apart_point_and_line(X0,X1) ),
inference(ennf_transformation,[],[f51]) ).
fof(f91,plain,
? [X0,X1] :
( ! [X2] :
( ~ incident_point_and_line(X2,X1)
| ~ point(X2) )
& line(X1)
& point(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f92,plain,
? [X0,X1] :
( ! [X2] :
( ~ incident_point_and_line(X2,X1)
| ~ point(X2) )
& line(X1)
& point(X0) ),
inference(flattening,[],[f91]) ).
fof(f93,plain,
( ? [X0,X1] :
( ! [X2] :
( ~ incident_point_and_line(X2,X1)
| ~ point(X2) )
& line(X1)
& point(X0) )
=> ( ! [X2] :
( ~ incident_point_and_line(X2,sK1)
| ~ point(X2) )
& line(sK1)
& point(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f94,plain,
( ! [X2] :
( ~ incident_point_and_line(X2,sK1)
| ~ point(X2) )
& line(sK1)
& point(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f92,f93]) ).
fof(f100,plain,
! [X2,X0,X1] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f104,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f118,plain,
! [X0,X1] : ~ unorthogonal_lines(orthogonal_through_point(X1,X0),X1),
inference(cnf_transformation,[],[f41]) ).
fof(f121,plain,
! [X0,X1] :
( unorthogonal_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f128,plain,
! [X0,X1] :
( point(intersection_point(X0,X1))
| ~ convergent_lines(X0,X1)
| ~ line(X1)
| ~ line(X0) ),
inference(cnf_transformation,[],[f85]) ).
fof(f129,plain,
! [X0,X1] :
( line(parallel_through_point(X0,X1))
| ~ point(X1)
| ~ line(X0) ),
inference(cnf_transformation,[],[f87]) ).
fof(f130,plain,
! [X0,X1] :
( line(orthogonal_through_point(X0,X1))
| ~ point(X1)
| ~ line(X0) ),
inference(cnf_transformation,[],[f89]) ).
fof(f131,plain,
! [X0,X1] :
( incident_point_and_line(X0,X1)
| apart_point_and_line(X0,X1) ),
inference(cnf_transformation,[],[f90]) ).
fof(f132,plain,
point(sK0),
inference(cnf_transformation,[],[f94]) ).
fof(f133,plain,
line(sK1),
inference(cnf_transformation,[],[f94]) ).
fof(f134,plain,
! [X2] :
( ~ incident_point_and_line(X2,sK1)
| ~ point(X2) ),
inference(cnf_transformation,[],[f94]) ).
cnf(c_54,plain,
( ~ convergent_lines(X0,X1)
| convergent_lines(X0,X2)
| convergent_lines(X1,X2) ),
inference(cnf_transformation,[],[f100]) ).
cnf(c_58,plain,
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f104]) ).
cnf(c_72,plain,
~ unorthogonal_lines(orthogonal_through_point(X0,X1),X0),
inference(cnf_transformation,[],[f118]) ).
cnf(c_75,plain,
( convergent_lines(X0,X1)
| unorthogonal_lines(X0,X1) ),
inference(cnf_transformation,[],[f121]) ).
cnf(c_82,plain,
( ~ convergent_lines(X0,X1)
| ~ line(X0)
| ~ line(X1)
| point(intersection_point(X0,X1)) ),
inference(cnf_transformation,[],[f128]) ).
cnf(c_83,plain,
( ~ line(X0)
| ~ point(X1)
| line(parallel_through_point(X0,X1)) ),
inference(cnf_transformation,[],[f129]) ).
cnf(c_84,plain,
( ~ line(X0)
| ~ point(X1)
| line(orthogonal_through_point(X0,X1)) ),
inference(cnf_transformation,[],[f130]) ).
cnf(c_85,plain,
( apart_point_and_line(X0,X1)
| incident_point_and_line(X0,X1) ),
inference(cnf_transformation,[],[f131]) ).
cnf(c_86,negated_conjecture,
( ~ incident_point_and_line(X0,sK1)
| ~ point(X0) ),
inference(cnf_transformation,[],[f134]) ).
cnf(c_87,negated_conjecture,
line(sK1),
inference(cnf_transformation,[],[f133]) ).
cnf(c_88,negated_conjecture,
point(sK0),
inference(cnf_transformation,[],[f132]) ).
cnf(c_297,plain,
( ~ point(X0)
| apart_point_and_line(X0,sK1) ),
inference(resolution,[status(thm)],[c_85,c_86]) ).
cnf(c_493,negated_conjecture,
point(sK0),
inference(demodulation,[status(thm)],[c_88]) ).
cnf(c_494,negated_conjecture,
line(sK1),
inference(demodulation,[status(thm)],[c_87]) ).
cnf(c_954,plain,
convergent_lines(orthogonal_through_point(X0,X1),X0),
inference(superposition,[status(thm)],[c_75,c_72]) ).
cnf(c_1003,plain,
( convergent_lines(orthogonal_through_point(X0,X1),X2)
| convergent_lines(X0,X2) ),
inference(superposition,[status(thm)],[c_954,c_54]) ).
cnf(c_1110,plain,
( ~ point(intersection_point(X0,sK1))
| ~ convergent_lines(X0,sK1) ),
inference(superposition,[status(thm)],[c_297,c_58]) ).
cnf(c_1155,plain,
( ~ convergent_lines(X0,sK1)
| ~ line(X0)
| ~ line(sK1) ),
inference(superposition,[status(thm)],[c_82,c_1110]) ).
cnf(c_1156,plain,
( ~ convergent_lines(X0,sK1)
| ~ line(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1155,c_494]) ).
cnf(c_1530,plain,
( ~ line(orthogonal_through_point(X0,X1))
| convergent_lines(X0,sK1) ),
inference(superposition,[status(thm)],[c_1003,c_1156]) ).
cnf(c_3188,plain,
( ~ point(X1)
| ~ line(X0) ),
inference(global_subsumption_just,[status(thm)],[c_83,c_84,c_1156,c_1530]) ).
cnf(c_3189,plain,
( ~ line(X0)
| ~ point(X1) ),
inference(renaming,[status(thm)],[c_3188]) ).
cnf(c_3203,plain,
~ line(X0),
inference(superposition,[status(thm)],[c_493,c_3189]) ).
cnf(c_3204,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_494,c_3203]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO224+3 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n028.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 May 3 01:31:18 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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
% 0.46/1.14 % SZS status Started for theBenchmark.p
% 0.46/1.14 % SZS status Theorem for theBenchmark.p
% 0.46/1.14
% 0.46/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.46/1.14
% 0.46/1.14 ------ iProver source info
% 0.46/1.14
% 0.46/1.14 git: date: 2024-05-02 19:28:25 +0000
% 0.46/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.46/1.14 git: non_committed_changes: false
% 0.46/1.14
% 0.46/1.14 ------ Parsing...
% 0.46/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.46/1.14
% 0.46/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 0.46/1.14
% 0.46/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.46/1.14 ------ Proving...
% 0.46/1.14 ------ Problem Properties
% 0.46/1.14
% 0.46/1.14
% 0.46/1.14 clauses 35
% 0.46/1.14 conjectures 2
% 0.46/1.14 EPR 23
% 0.46/1.14 Horn 19
% 0.46/1.14 unary 9
% 0.46/1.14 binary 7
% 0.46/1.14 lits 93
% 0.46/1.14 lits eq 0
% 0.46/1.14 fd_pure 0
% 0.46/1.14 fd_pseudo 0
% 0.46/1.14 fd_cond 0
% 0.46/1.14 fd_pseudo_cond 0
% 0.46/1.14 AC symbols 0
% 0.46/1.14
% 0.46/1.14 ------ Schedule dynamic 5 is on
% 0.46/1.14
% 0.46/1.14 ------ no equalities: superposition off
% 0.46/1.14
% 0.46/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.46/1.14
% 0.46/1.14
% 0.46/1.14 ------
% 0.46/1.14 Current options:
% 0.46/1.14 ------
% 0.46/1.14
% 0.46/1.14
% 0.46/1.14
% 0.46/1.14
% 0.46/1.14 ------ Proving...
% 0.46/1.14
% 0.46/1.14
% 0.46/1.14 % SZS status Theorem for theBenchmark.p
% 0.46/1.14
% 0.46/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.14
% 0.46/1.14
%------------------------------------------------------------------------------