TSTP Solution File: GEO112+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO112+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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:27 EDT 2023
% Result : Theorem 4.19s 1.15s
% Output : CNFRefutation 4.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 38 ( 8 unt; 0 def)
% Number of atoms : 144 ( 23 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 175 ( 69 ~; 61 |; 38 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 135 ( 4 sgn; 72 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X0,X2,X4,X6] :
( between_c(X0,X2,X4,X6)
<=> ( ? [X7] :
( inner_point(X4,X7)
& end_point(X6,X7)
& end_point(X2,X7)
& part_of(X7,X0) )
& X2 != X6 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',between_c_defn) ).
fof(f18,conjecture,
! [X0,X2,X4,X6] :
( between_c(X0,X2,X4,X6)
=> between_c(X0,X6,X4,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_3_8_2) ).
fof(f19,negated_conjecture,
~ ! [X0,X2,X4,X6] :
( between_c(X0,X2,X4,X6)
=> between_c(X0,X6,X4,X2) ),
inference(negated_conjecture,[],[f18]) ).
fof(f33,plain,
! [X0,X1,X2,X3] :
( between_c(X0,X1,X2,X3)
<=> ( ? [X4] :
( inner_point(X2,X4)
& end_point(X3,X4)
& end_point(X1,X4)
& part_of(X4,X0) )
& X1 != X3 ) ),
inference(rectify,[],[f17]) ).
fof(f34,plain,
~ ! [X0,X1,X2,X3] :
( between_c(X0,X1,X2,X3)
=> between_c(X0,X3,X2,X1) ),
inference(rectify,[],[f19]) ).
fof(f56,plain,
? [X0,X1,X2,X3] :
( ~ between_c(X0,X3,X2,X1)
& between_c(X0,X1,X2,X3) ),
inference(ennf_transformation,[],[f34]) ).
fof(f94,plain,
! [X0,X1,X2,X3] :
( ( between_c(X0,X1,X2,X3)
| ! [X4] :
( ~ inner_point(X2,X4)
| ~ end_point(X3,X4)
| ~ end_point(X1,X4)
| ~ part_of(X4,X0) )
| X1 = X3 )
& ( ( ? [X4] :
( inner_point(X2,X4)
& end_point(X3,X4)
& end_point(X1,X4)
& part_of(X4,X0) )
& X1 != X3 )
| ~ between_c(X0,X1,X2,X3) ) ),
inference(nnf_transformation,[],[f33]) ).
fof(f95,plain,
! [X0,X1,X2,X3] :
( ( between_c(X0,X1,X2,X3)
| ! [X4] :
( ~ inner_point(X2,X4)
| ~ end_point(X3,X4)
| ~ end_point(X1,X4)
| ~ part_of(X4,X0) )
| X1 = X3 )
& ( ( ? [X4] :
( inner_point(X2,X4)
& end_point(X3,X4)
& end_point(X1,X4)
& part_of(X4,X0) )
& X1 != X3 )
| ~ between_c(X0,X1,X2,X3) ) ),
inference(flattening,[],[f94]) ).
fof(f96,plain,
! [X0,X1,X2,X3] :
( ( between_c(X0,X1,X2,X3)
| ! [X4] :
( ~ inner_point(X2,X4)
| ~ end_point(X3,X4)
| ~ end_point(X1,X4)
| ~ part_of(X4,X0) )
| X1 = X3 )
& ( ( ? [X5] :
( inner_point(X2,X5)
& end_point(X3,X5)
& end_point(X1,X5)
& part_of(X5,X0) )
& X1 != X3 )
| ~ between_c(X0,X1,X2,X3) ) ),
inference(rectify,[],[f95]) ).
fof(f97,plain,
! [X0,X1,X2,X3] :
( ? [X5] :
( inner_point(X2,X5)
& end_point(X3,X5)
& end_point(X1,X5)
& part_of(X5,X0) )
=> ( inner_point(X2,sK13(X0,X1,X2,X3))
& end_point(X3,sK13(X0,X1,X2,X3))
& end_point(X1,sK13(X0,X1,X2,X3))
& part_of(sK13(X0,X1,X2,X3),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
! [X0,X1,X2,X3] :
( ( between_c(X0,X1,X2,X3)
| ! [X4] :
( ~ inner_point(X2,X4)
| ~ end_point(X3,X4)
| ~ end_point(X1,X4)
| ~ part_of(X4,X0) )
| X1 = X3 )
& ( ( inner_point(X2,sK13(X0,X1,X2,X3))
& end_point(X3,sK13(X0,X1,X2,X3))
& end_point(X1,sK13(X0,X1,X2,X3))
& part_of(sK13(X0,X1,X2,X3),X0)
& X1 != X3 )
| ~ between_c(X0,X1,X2,X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f96,f97]) ).
fof(f99,plain,
( ? [X0,X1,X2,X3] :
( ~ between_c(X0,X3,X2,X1)
& between_c(X0,X1,X2,X3) )
=> ( ~ between_c(sK14,sK17,sK16,sK15)
& between_c(sK14,sK15,sK16,sK17) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
( ~ between_c(sK14,sK17,sK16,sK15)
& between_c(sK14,sK15,sK16,sK17) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15,sK16,sK17])],[f56,f99]) ).
fof(f142,plain,
! [X2,X3,X0,X1] :
( X1 != X3
| ~ between_c(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f98]) ).
fof(f143,plain,
! [X2,X3,X0,X1] :
( part_of(sK13(X0,X1,X2,X3),X0)
| ~ between_c(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f98]) ).
fof(f144,plain,
! [X2,X3,X0,X1] :
( end_point(X1,sK13(X0,X1,X2,X3))
| ~ between_c(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f98]) ).
fof(f145,plain,
! [X2,X3,X0,X1] :
( end_point(X3,sK13(X0,X1,X2,X3))
| ~ between_c(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f98]) ).
fof(f146,plain,
! [X2,X3,X0,X1] :
( inner_point(X2,sK13(X0,X1,X2,X3))
| ~ between_c(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f98]) ).
fof(f147,plain,
! [X2,X3,X0,X1,X4] :
( between_c(X0,X1,X2,X3)
| ~ inner_point(X2,X4)
| ~ end_point(X3,X4)
| ~ end_point(X1,X4)
| ~ part_of(X4,X0)
| X1 = X3 ),
inference(cnf_transformation,[],[f98]) ).
fof(f148,plain,
between_c(sK14,sK15,sK16,sK17),
inference(cnf_transformation,[],[f100]) ).
fof(f149,plain,
~ between_c(sK14,sK17,sK16,sK15),
inference(cnf_transformation,[],[f100]) ).
fof(f154,plain,
! [X2,X3,X0] : ~ between_c(X0,X3,X2,X3),
inference(equality_resolution,[],[f142]) ).
cnf(c_90,plain,
( ~ part_of(X0,X1)
| ~ end_point(X2,X0)
| ~ end_point(X3,X0)
| ~ inner_point(X4,X0)
| X2 = X3
| between_c(X1,X2,X4,X3) ),
inference(cnf_transformation,[],[f147]) ).
cnf(c_91,plain,
( ~ between_c(X0,X1,X2,X3)
| inner_point(X2,sK13(X0,X1,X2,X3)) ),
inference(cnf_transformation,[],[f146]) ).
cnf(c_92,plain,
( ~ between_c(X0,X1,X2,X3)
| end_point(X3,sK13(X0,X1,X2,X3)) ),
inference(cnf_transformation,[],[f145]) ).
cnf(c_93,plain,
( ~ between_c(X0,X1,X2,X3)
| end_point(X1,sK13(X0,X1,X2,X3)) ),
inference(cnf_transformation,[],[f144]) ).
cnf(c_94,plain,
( ~ between_c(X0,X1,X2,X3)
| part_of(sK13(X0,X1,X2,X3),X0) ),
inference(cnf_transformation,[],[f143]) ).
cnf(c_95,plain,
~ between_c(X0,X1,X2,X1),
inference(cnf_transformation,[],[f154]) ).
cnf(c_96,negated_conjecture,
~ between_c(sK14,sK17,sK16,sK15),
inference(cnf_transformation,[],[f149]) ).
cnf(c_97,negated_conjecture,
between_c(sK14,sK15,sK16,sK17),
inference(cnf_transformation,[],[f148]) ).
cnf(c_587,plain,
( X0 != sK14
| X1 != sK17
| X1 != sK15
| X2 != sK16 ),
inference(resolution_lifted,[status(thm)],[c_95,c_97]) ).
cnf(c_588,plain,
sK17 != sK15,
inference(unflattening,[status(thm)],[c_587]) ).
cnf(c_2469,plain,
( ~ part_of(sK13(X0,X1,X2,X3),X4)
| ~ end_point(X5,sK13(X0,X1,X2,X3))
| ~ end_point(X6,sK13(X0,X1,X2,X3))
| ~ between_c(X0,X1,X2,X3)
| X5 = X6
| between_c(X4,X5,X2,X6) ),
inference(resolution,[status(thm)],[c_90,c_91]) ).
cnf(c_2504,plain,
( ~ part_of(sK13(X0,X1,X2,X3),X4)
| ~ end_point(X5,sK13(X0,X1,X2,X3))
| ~ between_c(X0,X1,X2,X3)
| X5 = X1
| between_c(X4,X5,X2,X1) ),
inference(resolution,[status(thm)],[c_2469,c_93]) ).
cnf(c_2630,plain,
( ~ part_of(sK13(X0,X1,X2,X3),X4)
| ~ between_c(X0,X1,X2,X3)
| X3 = X1
| between_c(X4,X3,X2,X1) ),
inference(resolution,[status(thm)],[c_2504,c_92]) ).
cnf(c_2644,plain,
( ~ between_c(X0,X1,X2,X3)
| X3 = X1
| between_c(X0,X3,X2,X1) ),
inference(resolution,[status(thm)],[c_2630,c_94]) ).
cnf(c_3395,plain,
( sK17 = sK15
| between_c(sK14,sK17,sK16,sK15) ),
inference(resolution,[status(thm)],[c_2644,c_97]) ).
cnf(c_3396,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3395,c_588,c_96]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO112+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n031.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:54:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.19/1.15 % SZS status Started for theBenchmark.p
% 4.19/1.15 % SZS status Theorem for theBenchmark.p
% 4.19/1.15
% 4.19/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.19/1.15
% 4.19/1.15 ------ iProver source info
% 4.19/1.15
% 4.19/1.15 git: date: 2023-05-31 18:12:56 +0000
% 4.19/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.19/1.15 git: non_committed_changes: false
% 4.19/1.15 git: last_make_outside_of_git: false
% 4.19/1.15
% 4.19/1.15 ------ Parsing...
% 4.19/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.19/1.15
% 4.19/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 4.19/1.15
% 4.19/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.19/1.15
% 4.19/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.19/1.15 ------ Proving...
% 4.19/1.15 ------ Problem Properties
% 4.19/1.15
% 4.19/1.15
% 4.19/1.15 clauses 49
% 4.19/1.15 conjectures 2
% 4.19/1.15 EPR 17
% 4.19/1.15 Horn 32
% 4.19/1.15 unary 4
% 4.19/1.15 binary 20
% 4.19/1.15 lits 146
% 4.19/1.15 lits eq 13
% 4.19/1.15 fd_pure 0
% 4.19/1.15 fd_pseudo 0
% 4.19/1.15 fd_cond 0
% 4.19/1.15 fd_pseudo_cond 8
% 4.19/1.15 AC symbols 0
% 4.19/1.15
% 4.19/1.15 ------ Input Options Time Limit: Unbounded
% 4.19/1.15
% 4.19/1.15
% 4.19/1.15 ------
% 4.19/1.15 Current options:
% 4.19/1.15 ------
% 4.19/1.15
% 4.19/1.15
% 4.19/1.15
% 4.19/1.15
% 4.19/1.15 ------ Proving...
% 4.19/1.15
% 4.19/1.15
% 4.19/1.15 % SZS status Theorem for theBenchmark.p
% 4.19/1.15
% 4.19/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.19/1.15
% 4.19/1.15
%------------------------------------------------------------------------------