TSTP Solution File: GEO173+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO173+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:50 EDT 2023
% Result : Theorem 1.69s 1.18s
% Output : CNFRefutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 9 unt; 0 def)
% Number of atoms : 117 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 129 ( 46 ~; 47 |; 28 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn; 44 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( distinct_points(X0,X1)
=> ~ apart_point_and_line(X0,line_connecting(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ci1) ).
fof(f8,axiom,
! [X0,X1] :
( distinct_points(X0,X1)
=> ~ apart_point_and_line(X1,line_connecting(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ci2) ).
fof(f11,axiom,
! [X0,X1,X3,X4] :
( ( distinct_lines(X3,X4)
& distinct_points(X0,X1) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X0,X4)
| apart_point_and_line(X0,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cu1) ).
fof(f15,conjecture,
! [X0,X1,X3,X4] :
( ( distinct_lines(X3,line_connecting(X0,X1))
& convergent_lines(X3,X4)
& distinct_points(X0,X1) )
=> ( apart_point_and_line(X1,X3)
| apart_point_and_line(X0,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f16,negated_conjecture,
~ ! [X0,X1,X3,X4] :
( ( distinct_lines(X3,line_connecting(X0,X1))
& convergent_lines(X3,X4)
& distinct_points(X0,X1) )
=> ( apart_point_and_line(X1,X3)
| apart_point_and_line(X0,X3) ) ),
inference(negated_conjecture,[],[f15]) ).
fof(f17,plain,
! [X0,X1,X2,X3] :
( ( distinct_lines(X2,X3)
& distinct_points(X0,X1) )
=> ( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X2)
| apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) ) ),
inference(rectify,[],[f11]) ).
fof(f18,plain,
~ ! [X0,X1,X2,X3] :
( ( distinct_lines(X2,line_connecting(X0,X1))
& convergent_lines(X2,X3)
& distinct_points(X0,X1) )
=> ( apart_point_and_line(X1,X2)
| apart_point_and_line(X0,X2) ) ),
inference(rectify,[],[f16]) ).
fof(f25,plain,
! [X0,X1] :
( ~ apart_point_and_line(X0,line_connecting(X0,X1))
| ~ distinct_points(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f26,plain,
! [X0,X1] :
( ~ apart_point_and_line(X1,line_connecting(X0,X1))
| ~ distinct_points(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f29,plain,
! [X0,X1,X2,X3] :
( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X2)
| apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2)
| ~ distinct_lines(X2,X3)
| ~ distinct_points(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f30,plain,
! [X0,X1,X2,X3] :
( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X2)
| apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2)
| ~ distinct_lines(X2,X3)
| ~ distinct_points(X0,X1) ),
inference(flattening,[],[f29]) ).
fof(f37,plain,
? [X0,X1,X2,X3] :
( ~ apart_point_and_line(X1,X2)
& ~ apart_point_and_line(X0,X2)
& distinct_lines(X2,line_connecting(X0,X1))
& convergent_lines(X2,X3)
& distinct_points(X0,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f38,plain,
? [X0,X1,X2,X3] :
( ~ apart_point_and_line(X1,X2)
& ~ apart_point_and_line(X0,X2)
& distinct_lines(X2,line_connecting(X0,X1))
& convergent_lines(X2,X3)
& distinct_points(X0,X1) ),
inference(flattening,[],[f37]) ).
fof(f39,plain,
( ? [X0,X1,X2,X3] :
( ~ apart_point_and_line(X1,X2)
& ~ apart_point_and_line(X0,X2)
& distinct_lines(X2,line_connecting(X0,X1))
& convergent_lines(X2,X3)
& distinct_points(X0,X1) )
=> ( ~ apart_point_and_line(sK1,sK2)
& ~ apart_point_and_line(sK0,sK2)
& distinct_lines(sK2,line_connecting(sK0,sK1))
& convergent_lines(sK2,sK3)
& distinct_points(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
( ~ apart_point_and_line(sK1,sK2)
& ~ apart_point_and_line(sK0,sK2)
& distinct_lines(sK2,line_connecting(sK0,sK1))
& convergent_lines(sK2,sK3)
& distinct_points(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f38,f39]) ).
fof(f47,plain,
! [X0,X1] :
( ~ apart_point_and_line(X0,line_connecting(X0,X1))
| ~ distinct_points(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f48,plain,
! [X0,X1] :
( ~ apart_point_and_line(X1,line_connecting(X0,X1))
| ~ distinct_points(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f51,plain,
! [X2,X3,X0,X1] :
( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X2)
| apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2)
| ~ distinct_lines(X2,X3)
| ~ distinct_points(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f55,plain,
distinct_points(sK0,sK1),
inference(cnf_transformation,[],[f40]) ).
fof(f57,plain,
distinct_lines(sK2,line_connecting(sK0,sK1)),
inference(cnf_transformation,[],[f40]) ).
fof(f58,plain,
~ apart_point_and_line(sK0,sK2),
inference(cnf_transformation,[],[f40]) ).
fof(f59,plain,
~ apart_point_and_line(sK1,sK2),
inference(cnf_transformation,[],[f40]) ).
cnf(c_55,plain,
( ~ apart_point_and_line(X0,line_connecting(X0,X1))
| ~ distinct_points(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
cnf(c_56,plain,
( ~ apart_point_and_line(X0,line_connecting(X1,X0))
| ~ distinct_points(X1,X0) ),
inference(cnf_transformation,[],[f48]) ).
cnf(c_59,plain,
( ~ distinct_points(X0,X1)
| ~ distinct_lines(X2,X3)
| apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X3)
| apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3) ),
inference(cnf_transformation,[],[f51]) ).
cnf(c_63,negated_conjecture,
~ apart_point_and_line(sK1,sK2),
inference(cnf_transformation,[],[f59]) ).
cnf(c_64,negated_conjecture,
~ apart_point_and_line(sK0,sK2),
inference(cnf_transformation,[],[f58]) ).
cnf(c_65,negated_conjecture,
distinct_lines(sK2,line_connecting(sK0,sK1)),
inference(cnf_transformation,[],[f57]) ).
cnf(c_67,negated_conjecture,
distinct_points(sK0,sK1),
inference(cnf_transformation,[],[f55]) ).
cnf(c_151,plain,
( ~ apart_point_and_line(sK0,line_connecting(sK0,sK1))
| ~ distinct_points(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_152,plain,
( ~ apart_point_and_line(sK1,line_connecting(sK0,sK1))
| ~ distinct_points(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_163,plain,
( ~ distinct_lines(X0,X1)
| ~ distinct_points(sK0,sK1)
| apart_point_and_line(sK1,X0)
| apart_point_and_line(sK1,X1)
| apart_point_and_line(sK0,X0)
| apart_point_and_line(sK0,X1) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_182,plain,
( ~ distinct_lines(sK2,line_connecting(sK0,sK1))
| ~ distinct_points(sK0,sK1)
| apart_point_and_line(sK1,line_connecting(sK0,sK1))
| apart_point_and_line(sK0,line_connecting(sK0,sK1))
| apart_point_and_line(sK1,sK2)
| apart_point_and_line(sK0,sK2) ),
inference(instantiation,[status(thm)],[c_163]) ).
cnf(c_183,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_182,c_152,c_151,c_65,c_63,c_64,c_67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO173+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n009.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 20:53:35 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.69/1.18 % SZS status Started for theBenchmark.p
% 1.69/1.18 % SZS status Theorem for theBenchmark.p
% 1.69/1.18
% 1.69/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.69/1.18
% 1.69/1.18 ------ iProver source info
% 1.69/1.18
% 1.69/1.18 git: date: 2023-05-31 18:12:56 +0000
% 1.69/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.69/1.18 git: non_committed_changes: false
% 1.69/1.18 git: last_make_outside_of_git: false
% 1.69/1.18
% 1.69/1.18 ------ Parsing...
% 1.69/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.69/1.18
% 1.69/1.18 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.69/1.18
% 1.69/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.69/1.18 ------ Proving...
% 1.69/1.18 ------ Problem Properties
% 1.69/1.18
% 1.69/1.18
% 1.69/1.18 clauses 19
% 1.69/1.18 conjectures 5
% 1.69/1.18 EPR 14
% 1.69/1.18 Horn 12
% 1.69/1.18 unary 8
% 1.69/1.18 binary 4
% 1.69/1.18 lits 40
% 1.69/1.18 lits eq 0
% 1.69/1.18 fd_pure 0
% 1.69/1.18 fd_pseudo 0
% 1.69/1.18 fd_cond 0
% 1.69/1.18 fd_pseudo_cond 0
% 1.69/1.18 AC symbols 0
% 1.69/1.18
% 1.69/1.18 ------ Schedule dynamic 5 is on
% 1.69/1.18
% 1.69/1.18 ------ no equalities: superposition off
% 1.69/1.18
% 1.69/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.69/1.18
% 1.69/1.18
% 1.69/1.18 ------
% 1.69/1.18 Current options:
% 1.69/1.18 ------
% 1.69/1.18
% 1.69/1.18
% 1.69/1.18
% 1.69/1.18
% 1.69/1.18 ------ Proving...
% 1.69/1.18
% 1.69/1.18
% 1.69/1.18 % SZS status Theorem for theBenchmark.p
% 1.69/1.18
% 1.69/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.69/1.18
% 1.69/1.18
%------------------------------------------------------------------------------