TSTP Solution File: GEO209+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO209+1 : TPTP v8.1.2. Released v3.3.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 : Wed Aug 30 23:10:18 EDT 2023
% Result : Theorem 0.47s 1.18s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 108 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 133 ( 57 ~; 33 |; 37 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 56 ( 0 sgn; 36 !; 12 ?)
% 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(f17,axiom,
! [X0,X1,X2] :
( distinct_lines(X1,X2)
=> ( convergent_lines(X1,X2)
| apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cup1) ).
fof(f18,conjecture,
! [X5,X6,X7,X8] :
( ( ~ convergent_lines(X8,X6)
& ~ convergent_lines(X7,X6)
& ~ apart_point_and_line(X5,X8)
& ~ apart_point_and_line(X5,X7)
& apart_point_and_line(X5,X6) )
=> ~ distinct_lines(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f19,negated_conjecture,
~ ! [X5,X6,X7,X8] :
( ( ~ convergent_lines(X8,X6)
& ~ convergent_lines(X7,X6)
& ~ apart_point_and_line(X5,X8)
& ~ apart_point_and_line(X5,X7)
& apart_point_and_line(X5,X6) )
=> ~ distinct_lines(X7,X8) ),
inference(negated_conjecture,[],[f18]) ).
fof(f21,plain,
~ ! [X0,X1,X2,X3] :
( ( ~ convergent_lines(X3,X1)
& ~ convergent_lines(X2,X1)
& ~ apart_point_and_line(X0,X3)
& ~ apart_point_and_line(X0,X2)
& apart_point_and_line(X0,X1) )
=> ~ distinct_lines(X2,X3) ),
inference(rectify,[],[f19]) ).
fof(f26,plain,
! [X0,X1,X2] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f27,plain,
! [X0,X1,X2] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f26]) ).
fof(f40,plain,
! [X0,X1,X2] :
( convergent_lines(X1,X2)
| apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X1)
| ~ distinct_lines(X1,X2) ),
inference(ennf_transformation,[],[f17]) ).
fof(f41,plain,
! [X0,X1,X2] :
( convergent_lines(X1,X2)
| apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X1)
| ~ distinct_lines(X1,X2) ),
inference(flattening,[],[f40]) ).
fof(f42,plain,
? [X0,X1,X2,X3] :
( distinct_lines(X2,X3)
& ~ convergent_lines(X3,X1)
& ~ convergent_lines(X2,X1)
& ~ apart_point_and_line(X0,X3)
& ~ apart_point_and_line(X0,X2)
& apart_point_and_line(X0,X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f43,plain,
? [X0,X1,X2,X3] :
( distinct_lines(X2,X3)
& ~ convergent_lines(X3,X1)
& ~ convergent_lines(X2,X1)
& ~ apart_point_and_line(X0,X3)
& ~ apart_point_and_line(X0,X2)
& apart_point_and_line(X0,X1) ),
inference(flattening,[],[f42]) ).
fof(f44,plain,
( ? [X0,X1,X2,X3] :
( distinct_lines(X2,X3)
& ~ convergent_lines(X3,X1)
& ~ convergent_lines(X2,X1)
& ~ apart_point_and_line(X0,X3)
& ~ apart_point_and_line(X0,X2)
& apart_point_and_line(X0,X1) )
=> ( distinct_lines(sK2,sK3)
& ~ convergent_lines(sK3,sK1)
& ~ convergent_lines(sK2,sK1)
& ~ apart_point_and_line(sK0,sK3)
& ~ apart_point_and_line(sK0,sK2)
& apart_point_and_line(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f45,plain,
( distinct_lines(sK2,sK3)
& ~ convergent_lines(sK3,sK1)
& ~ convergent_lines(sK2,sK1)
& ~ apart_point_and_line(sK0,sK3)
& ~ apart_point_and_line(sK0,sK2)
& apart_point_and_line(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f43,f44]) ).
fof(f51,plain,
! [X2,X0,X1] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f62,plain,
! [X2,X0,X1] :
( convergent_lines(X1,X2)
| apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X1)
| ~ distinct_lines(X1,X2) ),
inference(cnf_transformation,[],[f41]) ).
fof(f64,plain,
~ apart_point_and_line(sK0,sK2),
inference(cnf_transformation,[],[f45]) ).
fof(f65,plain,
~ apart_point_and_line(sK0,sK3),
inference(cnf_transformation,[],[f45]) ).
fof(f66,plain,
~ convergent_lines(sK2,sK1),
inference(cnf_transformation,[],[f45]) ).
fof(f67,plain,
~ convergent_lines(sK3,sK1),
inference(cnf_transformation,[],[f45]) ).
fof(f68,plain,
distinct_lines(sK2,sK3),
inference(cnf_transformation,[],[f45]) ).
cnf(c_54,plain,
( ~ convergent_lines(X0,X1)
| convergent_lines(X0,X2)
| convergent_lines(X1,X2) ),
inference(cnf_transformation,[],[f51]) ).
cnf(c_65,plain,
( ~ distinct_lines(X0,X1)
| convergent_lines(X0,X1)
| apart_point_and_line(X2,X0)
| apart_point_and_line(X2,X1) ),
inference(cnf_transformation,[],[f62]) ).
cnf(c_66,negated_conjecture,
distinct_lines(sK2,sK3),
inference(cnf_transformation,[],[f68]) ).
cnf(c_67,negated_conjecture,
~ convergent_lines(sK3,sK1),
inference(cnf_transformation,[],[f67]) ).
cnf(c_68,negated_conjecture,
~ convergent_lines(sK2,sK1),
inference(cnf_transformation,[],[f66]) ).
cnf(c_69,negated_conjecture,
~ apart_point_and_line(sK0,sK3),
inference(cnf_transformation,[],[f65]) ).
cnf(c_70,negated_conjecture,
~ apart_point_and_line(sK0,sK2),
inference(cnf_transformation,[],[f64]) ).
cnf(c_176,plain,
( ~ distinct_lines(sK2,sK3)
| apart_point_and_line(X0,sK2)
| apart_point_and_line(X0,sK3)
| convergent_lines(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_65]) ).
cnf(c_177,plain,
( ~ distinct_lines(sK2,sK3)
| convergent_lines(sK2,sK3)
| apart_point_and_line(sK0,sK2)
| apart_point_and_line(sK0,sK3) ),
inference(instantiation,[status(thm)],[c_176]) ).
cnf(c_189,plain,
( ~ convergent_lines(sK2,sK3)
| convergent_lines(sK2,X0)
| convergent_lines(sK3,X0) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_217,plain,
( ~ convergent_lines(sK2,sK3)
| convergent_lines(sK2,sK1)
| convergent_lines(sK3,sK1) ),
inference(instantiation,[status(thm)],[c_189]) ).
cnf(c_218,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_217,c_177,c_67,c_68,c_69,c_70,c_66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO209+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 : Wed Aug 30 00:19:26 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.47/1.18 % SZS status Started for theBenchmark.p
% 0.47/1.18 % SZS status Theorem for theBenchmark.p
% 0.47/1.18
% 0.47/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.47/1.18
% 0.47/1.18 ------ iProver source info
% 0.47/1.18
% 0.47/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.47/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.47/1.18 git: non_committed_changes: false
% 0.47/1.18 git: last_make_outside_of_git: false
% 0.47/1.18
% 0.47/1.18 ------ Parsing...
% 0.47/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.47/1.18
% 0.47/1.18 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 0.47/1.18
% 0.47/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.18 ------ Proving...
% 0.47/1.18 ------ Problem Properties
% 0.47/1.18
% 0.47/1.18
% 0.47/1.18 clauses 23
% 0.47/1.18 conjectures 6
% 0.47/1.18 EPR 17
% 0.47/1.18 Horn 15
% 0.47/1.18 unary 11
% 0.47/1.18 binary 4
% 0.47/1.18 lits 47
% 0.47/1.18 lits eq 0
% 0.47/1.18 fd_pure 0
% 0.47/1.18 fd_pseudo 0
% 0.47/1.18 fd_cond 0
% 0.47/1.18 fd_pseudo_cond 0
% 0.47/1.18 AC symbols 0
% 0.47/1.18
% 0.47/1.18 ------ Schedule dynamic 5 is on
% 0.47/1.18
% 0.47/1.18 ------ no equalities: superposition off
% 0.47/1.18
% 0.47/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.47/1.18
% 0.47/1.18
% 0.47/1.18 ------
% 0.47/1.18 Current options:
% 0.47/1.18 ------
% 0.47/1.18
% 0.47/1.18
% 0.47/1.18
% 0.47/1.18
% 0.47/1.18 ------ Proving...
% 0.47/1.18
% 0.47/1.18
% 0.47/1.18 % SZS status Theorem for theBenchmark.p
% 0.47/1.18
% 0.47/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.18
% 0.47/1.18
%------------------------------------------------------------------------------