TSTP Solution File: GEO117+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO117+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:29 EDT 2023
% Result : Theorem 4.04s 1.17s
% Output : CNFRefutation 4.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 12 unt; 0 def)
% Number of atoms : 188 ( 11 equ)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 232 ( 81 ~; 73 |; 66 &)
% ( 8 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-4 aty)
% Number of variables : 140 ( 4 sgn; 105 !; 18 ?)
% 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/sandbox2/benchmark/theBenchmark.p',between_c_defn) ).
fof(f18,axiom,
! [X8,X2,X4,X6] :
( between_o(X8,X2,X4,X6)
<=> ( ( ordered_by(X8,X4,X2)
& ordered_by(X8,X6,X4) )
| ( ordered_by(X8,X4,X6)
& ordered_by(X8,X2,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',between_o_defn) ).
fof(f23,axiom,
! [X2,X4,X6,X8] :
( between_o(X8,X2,X4,X6)
<=> ? [X0] :
( between_c(X0,X2,X4,X6)
& ! [X2] :
( incident_o(X2,X8)
<=> incident_c(X2,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',o3) ).
fof(f28,conjecture,
! [X8,X2] : ~ ordered_by(X8,X2,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_4_4) ).
fof(f29,negated_conjecture,
~ ! [X8,X2] : ~ ordered_by(X8,X2,X2),
inference(negated_conjecture,[],[f28]) ).
fof(f43,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(f44,plain,
! [X0,X1,X2,X3] :
( between_o(X0,X1,X2,X3)
<=> ( ( ordered_by(X0,X2,X1)
& ordered_by(X0,X3,X2) )
| ( ordered_by(X0,X2,X3)
& ordered_by(X0,X1,X2) ) ) ),
inference(rectify,[],[f18]) ).
fof(f49,plain,
! [X0,X1,X2,X3] :
( between_o(X3,X0,X1,X2)
<=> ? [X4] :
( between_c(X4,X0,X1,X2)
& ! [X5] :
( incident_o(X5,X3)
<=> incident_c(X5,X4) ) ) ),
inference(rectify,[],[f23]) ).
fof(f54,plain,
~ ! [X0,X1] : ~ ordered_by(X0,X1,X1),
inference(rectify,[],[f29]) ).
fof(f81,plain,
? [X0,X1] : ordered_by(X0,X1,X1),
inference(ennf_transformation,[],[f54]) ).
fof(f121,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,[],[f43]) ).
fof(f122,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,[],[f121]) ).
fof(f123,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,[],[f122]) ).
fof(f124,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(f125,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])],[f123,f124]) ).
fof(f126,plain,
! [X0,X1,X2,X3] :
( ( between_o(X0,X1,X2,X3)
| ( ( ~ ordered_by(X0,X2,X1)
| ~ ordered_by(X0,X3,X2) )
& ( ~ ordered_by(X0,X2,X3)
| ~ ordered_by(X0,X1,X2) ) ) )
& ( ( ordered_by(X0,X2,X1)
& ordered_by(X0,X3,X2) )
| ( ordered_by(X0,X2,X3)
& ordered_by(X0,X1,X2) )
| ~ between_o(X0,X1,X2,X3) ) ),
inference(nnf_transformation,[],[f44]) ).
fof(f127,plain,
! [X0,X1,X2,X3] :
( ( between_o(X0,X1,X2,X3)
| ( ( ~ ordered_by(X0,X2,X1)
| ~ ordered_by(X0,X3,X2) )
& ( ~ ordered_by(X0,X2,X3)
| ~ ordered_by(X0,X1,X2) ) ) )
& ( ( ordered_by(X0,X2,X1)
& ordered_by(X0,X3,X2) )
| ( ordered_by(X0,X2,X3)
& ordered_by(X0,X1,X2) )
| ~ between_o(X0,X1,X2,X3) ) ),
inference(flattening,[],[f126]) ).
fof(f131,plain,
! [X0,X1,X2,X3] :
( ( between_o(X3,X0,X1,X2)
| ! [X4] :
( ~ between_c(X4,X0,X1,X2)
| ? [X5] :
( ( ~ incident_c(X5,X4)
| ~ incident_o(X5,X3) )
& ( incident_c(X5,X4)
| incident_o(X5,X3) ) ) ) )
& ( ? [X4] :
( between_c(X4,X0,X1,X2)
& ! [X5] :
( ( incident_o(X5,X3)
| ~ incident_c(X5,X4) )
& ( incident_c(X5,X4)
| ~ incident_o(X5,X3) ) ) )
| ~ between_o(X3,X0,X1,X2) ) ),
inference(nnf_transformation,[],[f49]) ).
fof(f132,plain,
! [X0,X1,X2,X3] :
( ( between_o(X3,X0,X1,X2)
| ! [X4] :
( ~ between_c(X4,X0,X1,X2)
| ? [X5] :
( ( ~ incident_c(X5,X4)
| ~ incident_o(X5,X3) )
& ( incident_c(X5,X4)
| incident_o(X5,X3) ) ) ) )
& ( ? [X6] :
( between_c(X6,X0,X1,X2)
& ! [X7] :
( ( incident_o(X7,X3)
| ~ incident_c(X7,X6) )
& ( incident_c(X7,X6)
| ~ incident_o(X7,X3) ) ) )
| ~ between_o(X3,X0,X1,X2) ) ),
inference(rectify,[],[f131]) ).
fof(f133,plain,
! [X3,X4] :
( ? [X5] :
( ( ~ incident_c(X5,X4)
| ~ incident_o(X5,X3) )
& ( incident_c(X5,X4)
| incident_o(X5,X3) ) )
=> ( ( ~ incident_c(sK15(X3,X4),X4)
| ~ incident_o(sK15(X3,X4),X3) )
& ( incident_c(sK15(X3,X4),X4)
| incident_o(sK15(X3,X4),X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
! [X0,X1,X2,X3] :
( ? [X6] :
( between_c(X6,X0,X1,X2)
& ! [X7] :
( ( incident_o(X7,X3)
| ~ incident_c(X7,X6) )
& ( incident_c(X7,X6)
| ~ incident_o(X7,X3) ) ) )
=> ( between_c(sK16(X0,X1,X2,X3),X0,X1,X2)
& ! [X7] :
( ( incident_o(X7,X3)
| ~ incident_c(X7,sK16(X0,X1,X2,X3)) )
& ( incident_c(X7,sK16(X0,X1,X2,X3))
| ~ incident_o(X7,X3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
! [X0,X1,X2,X3] :
( ( between_o(X3,X0,X1,X2)
| ! [X4] :
( ~ between_c(X4,X0,X1,X2)
| ( ( ~ incident_c(sK15(X3,X4),X4)
| ~ incident_o(sK15(X3,X4),X3) )
& ( incident_c(sK15(X3,X4),X4)
| incident_o(sK15(X3,X4),X3) ) ) ) )
& ( ( between_c(sK16(X0,X1,X2,X3),X0,X1,X2)
& ! [X7] :
( ( incident_o(X7,X3)
| ~ incident_c(X7,sK16(X0,X1,X2,X3)) )
& ( incident_c(X7,sK16(X0,X1,X2,X3))
| ~ incident_o(X7,X3) ) ) )
| ~ between_o(X3,X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK15,sK16])],[f132,f134,f133]) ).
fof(f148,plain,
( ? [X0,X1] : ordered_by(X0,X1,X1)
=> ordered_by(sK22,sK23,sK23) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
ordered_by(sK22,sK23,sK23),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK22,sK23])],[f81,f148]) ).
fof(f192,plain,
! [X2,X3,X0,X1] :
( X1 != X3
| ~ between_c(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f125]) ).
fof(f203,plain,
! [X2,X3,X0,X1] :
( between_o(X0,X1,X2,X3)
| ~ ordered_by(X0,X2,X1)
| ~ ordered_by(X0,X3,X2) ),
inference(cnf_transformation,[],[f127]) ).
fof(f213,plain,
! [X2,X3,X0,X1] :
( between_c(sK16(X0,X1,X2,X3),X0,X1,X2)
| ~ between_o(X3,X0,X1,X2) ),
inference(cnf_transformation,[],[f135]) ).
fof(f226,plain,
ordered_by(sK22,sK23,sK23),
inference(cnf_transformation,[],[f149]) ).
fof(f231,plain,
! [X2,X3,X0] : ~ between_c(X0,X3,X2,X3),
inference(equality_resolution,[],[f192]) ).
cnf(c_96,plain,
~ between_c(X0,X1,X2,X1),
inference(cnf_transformation,[],[f231]) ).
cnf(c_97,plain,
( ~ ordered_by(X0,X1,X2)
| ~ ordered_by(X0,X2,X3)
| between_o(X0,X3,X2,X1) ),
inference(cnf_transformation,[],[f203]) ).
cnf(c_112,plain,
( ~ between_o(X0,X1,X2,X3)
| between_c(sK16(X1,X2,X3,X0),X1,X2,X3) ),
inference(cnf_transformation,[],[f213]) ).
cnf(c_125,negated_conjecture,
ordered_by(sK22,sK23,sK23),
inference(cnf_transformation,[],[f226]) ).
cnf(c_10640,plain,
~ between_o(X0,X1,X2,X1),
inference(superposition,[status(thm)],[c_112,c_96]) ).
cnf(c_10723,plain,
( ~ ordered_by(X0,X1,X2)
| ~ ordered_by(X0,X2,X1) ),
inference(superposition,[status(thm)],[c_97,c_10640]) ).
cnf(c_10782,plain,
~ ordered_by(sK22,sK23,sK23),
inference(superposition,[status(thm)],[c_125,c_10723]) ).
cnf(c_10783,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10782,c_125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO117+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n011.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 : Tue Aug 29 23:25:42 EDT 2023
% 0.20/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
% 4.04/1.17 % SZS status Started for theBenchmark.p
% 4.04/1.17 % SZS status Theorem for theBenchmark.p
% 4.04/1.17
% 4.04/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.04/1.17
% 4.04/1.17 ------ iProver source info
% 4.04/1.17
% 4.04/1.17 git: date: 2023-05-31 18:12:56 +0000
% 4.04/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.04/1.17 git: non_committed_changes: false
% 4.04/1.17 git: last_make_outside_of_git: false
% 4.04/1.17
% 4.04/1.17 ------ Parsing...
% 4.04/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.04/1.17
% 4.04/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 4.04/1.17
% 4.04/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.04/1.17
% 4.04/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.04/1.17 ------ Proving...
% 4.04/1.17 ------ Problem Properties
% 4.04/1.17
% 4.04/1.17
% 4.04/1.17 clauses 76
% 4.04/1.17 conjectures 1
% 4.04/1.17 EPR 25
% 4.04/1.17 Horn 48
% 4.04/1.17 unary 5
% 4.04/1.17 binary 28
% 4.04/1.17 lits 227
% 4.04/1.17 lits eq 21
% 4.04/1.17 fd_pure 0
% 4.04/1.17 fd_pseudo 0
% 4.04/1.17 fd_cond 0
% 4.04/1.17 fd_pseudo_cond 16
% 4.04/1.17 AC symbols 0
% 4.04/1.17
% 4.04/1.17 ------ Schedule dynamic 5 is on
% 4.04/1.17
% 4.04/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.04/1.17
% 4.04/1.17
% 4.04/1.17 ------
% 4.04/1.17 Current options:
% 4.04/1.17 ------
% 4.04/1.17
% 4.04/1.17
% 4.04/1.17
% 4.04/1.17
% 4.04/1.17 ------ Proving...
% 4.04/1.17
% 4.04/1.17
% 4.04/1.17 % SZS status Theorem for theBenchmark.p
% 4.04/1.17
% 4.04/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.04/1.17
% 4.04/1.17
%------------------------------------------------------------------------------