TSTP Solution File: GEO171+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO171+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:48 EDT 2023
% Result : Theorem 0.48s 1.17s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 62 ( 25 ~; 28 |; 4 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 45 ( 0 sgn; 30 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ convergent_lines(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',apart3) ).
fof(f6,axiom,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( convergent_lines(X1,X2)
| convergent_lines(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
fof(f14,axiom,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( convergent_lines(X0,X2)
| distinct_lines(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ceq3) ).
fof(f36,conjecture,
! [X0,X1] :
( convergent_lines(X0,X1)
=> distinct_lines(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f37,negated_conjecture,
~ ! [X0,X1] :
( convergent_lines(X0,X1)
=> distinct_lines(X0,X1) ),
inference(negated_conjecture,[],[f36]) ).
fof(f55,plain,
! [X0,X1,X2] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f56,plain,
! [X0,X1,X2] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f55]) ).
fof(f67,plain,
! [X0,X1,X2] :
( convergent_lines(X0,X2)
| distinct_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f68,plain,
! [X0,X1,X2] :
( convergent_lines(X0,X2)
| distinct_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f67]) ).
fof(f89,plain,
? [X0,X1] :
( ~ distinct_lines(X0,X1)
& convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f37]) ).
fof(f90,plain,
( ? [X0,X1] :
( ~ distinct_lines(X0,X1)
& convergent_lines(X0,X1) )
=> ( ~ distinct_lines(sK0,sK1)
& convergent_lines(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f91,plain,
( ~ distinct_lines(sK0,sK1)
& convergent_lines(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f89,f90]) ).
fof(f94,plain,
! [X0] : ~ convergent_lines(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f97,plain,
! [X2,X0,X1] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f105,plain,
! [X2,X0,X1] :
( convergent_lines(X0,X2)
| distinct_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f68]) ).
fof(f128,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f91]) ).
fof(f129,plain,
~ distinct_lines(sK0,sK1),
inference(cnf_transformation,[],[f91]) ).
cnf(c_51,plain,
~ convergent_lines(X0,X0),
inference(cnf_transformation,[],[f94]) ).
cnf(c_54,plain,
( ~ convergent_lines(X0,X1)
| convergent_lines(X0,X2)
| convergent_lines(X1,X2) ),
inference(cnf_transformation,[],[f97]) ).
cnf(c_62,plain,
( ~ convergent_lines(X0,X1)
| distinct_lines(X1,X2)
| convergent_lines(X0,X2) ),
inference(cnf_transformation,[],[f105]) ).
cnf(c_85,negated_conjecture,
~ distinct_lines(sK0,sK1),
inference(cnf_transformation,[],[f129]) ).
cnf(c_86,negated_conjecture,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f128]) ).
cnf(c_87,plain,
~ convergent_lines(sK0,sK0),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_441,plain,
( ~ convergent_lines(sK0,sK1)
| convergent_lines(sK0,X0)
| convergent_lines(sK1,X0) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_442,plain,
( ~ convergent_lines(sK0,sK1)
| convergent_lines(sK0,sK0)
| convergent_lines(sK1,sK0) ),
inference(instantiation,[status(thm)],[c_441]) ).
cnf(c_459,plain,
( ~ convergent_lines(sK1,X0)
| distinct_lines(X0,X1)
| convergent_lines(sK1,X1) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_470,plain,
~ convergent_lines(sK1,sK1),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_581,plain,
( ~ convergent_lines(sK1,X0)
| distinct_lines(X0,sK1)
| convergent_lines(sK1,sK1) ),
inference(instantiation,[status(thm)],[c_459]) ).
cnf(c_582,plain,
( ~ convergent_lines(sK1,sK0)
| distinct_lines(sK0,sK1)
| convergent_lines(sK1,sK1) ),
inference(instantiation,[status(thm)],[c_581]) ).
cnf(c_583,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_582,c_470,c_442,c_87,c_85,c_86]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO171+3 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 23:55:48 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.48/1.17 % SZS status Started for theBenchmark.p
% 0.48/1.17 % SZS status Theorem for theBenchmark.p
% 0.48/1.17
% 0.48/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.17
% 0.48/1.17 ------ iProver source info
% 0.48/1.17
% 0.48/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.17 git: non_committed_changes: false
% 0.48/1.17 git: last_make_outside_of_git: false
% 0.48/1.17
% 0.48/1.17 ------ Parsing...
% 0.48/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... sf_s rm: 4 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.17 ------ Proving...
% 0.48/1.17 ------ Problem Properties
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 clauses 30
% 0.48/1.17 conjectures 2
% 0.48/1.17 EPR 22
% 0.48/1.17 Horn 14
% 0.48/1.17 unary 9
% 0.48/1.17 binary 6
% 0.48/1.17 lits 77
% 0.48/1.17 lits eq 0
% 0.48/1.17 fd_pure 0
% 0.48/1.17 fd_pseudo 0
% 0.48/1.17 fd_cond 0
% 0.48/1.17 fd_pseudo_cond 0
% 0.48/1.17 AC symbols 0
% 0.48/1.17
% 0.48/1.17 ------ Schedule dynamic 5 is on
% 0.48/1.17
% 0.48/1.17 ------ no equalities: superposition off
% 0.48/1.17
% 0.48/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------
% 0.48/1.17 Current options:
% 0.48/1.17 ------
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------ Proving...
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 % SZS status Theorem for theBenchmark.p
% 0.48/1.17
% 0.48/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.17
% 0.48/1.17
%------------------------------------------------------------------------------