TSTP Solution File: GEO225+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GEO225+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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.16s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 3 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 81 ( 26 ~; 17 |; 29 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 39 ( 0 sgn 24 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( distinct_points(X0,X1)
=> ~ apart_point_and_line(X0,line_connecting(X0,X1)) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',ci2) ).
fof(f19,conjecture,
! [X5,X6] :
( ( distinct_points(X5,X6)
& point(X6)
& point(X5) )
=> ? [X0] :
( line(X0)
=> ( ~ apart_point_and_line(X6,X0)
& ~ apart_point_and_line(X5,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f20,negated_conjecture,
~ ! [X5,X6] :
( ( distinct_points(X5,X6)
& point(X6)
& point(X5) )
=> ? [X0] :
( line(X0)
=> ( ~ apart_point_and_line(X6,X0)
& ~ apart_point_and_line(X5,X0) ) ) ),
inference(negated_conjecture,[],[f19]) ).
fof(f26,plain,
~ ! [X0,X1] :
( ( distinct_points(X0,X1)
& point(X1)
& point(X0) )
=> ? [X2] :
( line(X2)
=> ( ~ apart_point_and_line(X1,X2)
& ~ apart_point_and_line(X0,X2) ) ) ),
inference(rectify,[],[f20]) ).
fof(f33,plain,
! [X0,X1] :
( ~ apart_point_and_line(X0,line_connecting(X0,X1))
| ~ distinct_points(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f34,plain,
! [X0,X1] :
( ~ apart_point_and_line(X1,line_connecting(X0,X1))
| ~ distinct_points(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f53,plain,
? [X0,X1] :
( ! [X2] :
( ( apart_point_and_line(X1,X2)
| apart_point_and_line(X0,X2) )
& line(X2) )
& distinct_points(X0,X1)
& point(X1)
& point(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f54,plain,
? [X0,X1] :
( ! [X2] :
( ( apart_point_and_line(X1,X2)
| apart_point_and_line(X0,X2) )
& line(X2) )
& distinct_points(X0,X1)
& point(X1)
& point(X0) ),
inference(flattening,[],[f53]) ).
fof(f55,plain,
( ? [X0,X1] :
( ! [X2] :
( ( apart_point_and_line(X1,X2)
| apart_point_and_line(X0,X2) )
& line(X2) )
& distinct_points(X0,X1)
& point(X1)
& point(X0) )
=> ( ! [X2] :
( ( apart_point_and_line(sK1,X2)
| apart_point_and_line(sK0,X2) )
& line(X2) )
& distinct_points(sK0,sK1)
& point(sK1)
& point(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f56,plain,
( ! [X2] :
( ( apart_point_and_line(sK1,X2)
| apart_point_and_line(sK0,X2) )
& line(X2) )
& distinct_points(sK0,sK1)
& point(sK1)
& point(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f54,f55]) ).
fof(f63,plain,
! [X0,X1] :
( ~ apart_point_and_line(X0,line_connecting(X0,X1))
| ~ distinct_points(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f64,plain,
! [X0,X1] :
( ~ apart_point_and_line(X1,line_connecting(X0,X1))
| ~ distinct_points(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f77,plain,
distinct_points(sK0,sK1),
inference(cnf_transformation,[],[f56]) ).
fof(f79,plain,
! [X2] :
( apart_point_and_line(sK1,X2)
| apart_point_and_line(sK0,X2) ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_55,plain,
( ~ apart_point_and_line(X0,line_connecting(X0,X1))
| ~ distinct_points(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
cnf(c_56,plain,
( ~ apart_point_and_line(X0,line_connecting(X1,X0))
| ~ distinct_points(X1,X0) ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_67,negated_conjecture,
( apart_point_and_line(sK1,X0)
| apart_point_and_line(sK0,X0) ),
inference(cnf_transformation,[],[f79]) ).
cnf(c_69,negated_conjecture,
distinct_points(sK0,sK1),
inference(cnf_transformation,[],[f77]) ).
cnf(c_229,negated_conjecture,
( apart_point_and_line(sK1,X0)
| apart_point_and_line(sK0,X0) ),
inference(demodulation,[status(thm)],[c_67]) ).
cnf(c_230,plain,
( ~ apart_point_and_line(sK0,line_connecting(sK0,sK1))
| ~ distinct_points(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_231,plain,
( ~ apart_point_and_line(sK1,line_connecting(sK0,sK1))
| ~ distinct_points(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_238,plain,
( apart_point_and_line(sK1,line_connecting(sK0,sK1))
| apart_point_and_line(sK0,line_connecting(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_229]) ).
cnf(c_239,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_238,c_231,c_230,c_69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GEO225+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.13 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 01:23:27 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.16 % SZS status Started for theBenchmark.p
% 0.46/1.16 % SZS status Theorem for theBenchmark.p
% 0.46/1.16
% 0.46/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.46/1.16
% 0.46/1.16 ------ iProver source info
% 0.46/1.16
% 0.46/1.16 git: date: 2024-05-02 19:28:25 +0000
% 0.46/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.46/1.16 git: non_committed_changes: false
% 0.46/1.16
% 0.46/1.16 ------ Parsing...
% 0.46/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.46/1.16
% 0.46/1.16 ------ Preprocessing... sf_s rm: 9 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 0.46/1.16
% 0.46/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.46/1.16 ------ Proving...
% 0.46/1.16 ------ Problem Properties
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 clauses 11
% 0.46/1.16 conjectures 2
% 0.46/1.16 EPR 9
% 0.46/1.16 Horn 5
% 0.46/1.16 unary 3
% 0.46/1.16 binary 3
% 0.46/1.16 lits 27
% 0.46/1.16 lits eq 0
% 0.46/1.16 fd_pure 0
% 0.46/1.16 fd_pseudo 0
% 0.46/1.16 fd_cond 0
% 0.46/1.16 fd_pseudo_cond 0
% 0.46/1.16 AC symbols 0
% 0.46/1.16
% 0.46/1.16 ------ Schedule dynamic 5 is on
% 0.46/1.16
% 0.46/1.16 ------ no equalities: superposition off
% 0.46/1.16
% 0.46/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 ------
% 0.46/1.16 Current options:
% 0.46/1.16 ------
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 ------ Proving...
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 % SZS status Theorem for theBenchmark.p
% 0.46/1.16
% 0.46/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.16
% 0.46/1.16
%------------------------------------------------------------------------------