TSTP Solution File: GEO526+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO526+1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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:11:36 EDT 2023
% Result : Theorem 183.26s 24.82s
% Output : CNFRefutation 183.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 50 ( 19 unt; 0 def)
% Number of atoms : 137 ( 29 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 156 ( 69 ~; 60 |; 26 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 114 ( 0 sgn; 72 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1,X2,X3,X4,X5] :
( s_e(X2,X3,X4,X5)
| ~ s_e(X0,X1,X4,X5)
| ~ s_e(X0,X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aA2) ).
fof(f98,axiom,
! [X12,X11,X15] :
( s(X11,X12) = X15
| ~ s_m(X12,X11,X15) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_6) ).
fof(f99,axiom,
! [X11,X12] : s(X11,s(X11,X12)) = X12,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_7) ).
fof(f120,axiom,
! [X11,X14,X13] :
( s_r(X11,X14,s(X14,X13))
| ~ s_r(X11,X14,X13) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz8_4) ).
fof(f194,axiom,
! [X11,X14,X13,X19] :
( s_e(X11,X13,X19,X13)
| ~ s_e(X11,X14,X19,X14)
| ~ s_r(X19,X14,X13)
| ~ s_r(X11,X14,X13) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz10_12b) ).
fof(f195,conjecture,
! [X11,X14,X13,X19,X21] :
( X13 = X21
| midpoint(X13,X21) != X14
| s_e(X11,X13,X19,X21)
| ~ s_e(X14,X13,X14,X21)
| ~ s_e(X11,X14,X19,X14)
| ~ s_r(X19,X14,X21)
| ~ s_r(X11,X14,X13) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz10_12c) ).
fof(f196,negated_conjecture,
~ ! [X11,X14,X13,X19,X21] :
( X13 = X21
| midpoint(X13,X21) != X14
| s_e(X11,X13,X19,X21)
| ~ s_e(X14,X13,X14,X21)
| ~ s_e(X11,X14,X19,X14)
| ~ s_r(X19,X14,X21)
| ~ s_r(X11,X14,X13) ),
inference(negated_conjecture,[],[f195]) ).
fof(f207,axiom,
! [X11,X14,X13] :
( ( ~ s_e(X11,X13,X11,s(X14,X13))
| s_r(X11,X14,X13) )
& ( s_e(X11,X13,X11,s(X14,X13))
| ~ s_r(X11,X14,X13) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d_Defn8_1) ).
fof(f301,plain,
! [X0,X1,X2] :
( s(X1,X0) = X2
| ~ s_m(X0,X1,X2) ),
inference(rectify,[],[f98]) ).
fof(f302,plain,
! [X0,X1] : s(X0,s(X0,X1)) = X1,
inference(rectify,[],[f99]) ).
fof(f323,plain,
! [X0,X1,X2] :
( s_r(X0,X1,s(X1,X2))
| ~ s_r(X0,X1,X2) ),
inference(rectify,[],[f120]) ).
fof(f396,plain,
! [X0,X1,X2,X3] :
( s_e(X0,X2,X3,X2)
| ~ s_e(X0,X1,X3,X1)
| ~ s_r(X3,X1,X2)
| ~ s_r(X0,X1,X2) ),
inference(rectify,[],[f194]) ).
fof(f397,plain,
~ ! [X0,X1,X2,X3,X4] :
( X2 = X4
| midpoint(X2,X4) != X1
| s_e(X0,X2,X3,X4)
| ~ s_e(X1,X2,X1,X4)
| ~ s_e(X0,X1,X3,X1)
| ~ s_r(X3,X1,X4)
| ~ s_r(X0,X1,X2) ),
inference(rectify,[],[f196]) ).
fof(f408,plain,
! [X0,X1,X2] :
( ( ~ s_e(X0,X2,X0,s(X1,X2))
| s_r(X0,X1,X2) )
& ( s_e(X0,X2,X0,s(X1,X2))
| ~ s_r(X0,X1,X2) ) ),
inference(rectify,[],[f207]) ).
fof(f413,plain,
? [X0,X1,X2,X3,X4] :
( X2 != X4
& midpoint(X2,X4) = X1
& ~ s_e(X0,X2,X3,X4)
& s_e(X1,X2,X1,X4)
& s_e(X0,X1,X3,X1)
& s_r(X3,X1,X4)
& s_r(X0,X1,X2) ),
inference(ennf_transformation,[],[f397]) ).
fof(f414,plain,
( ? [X0,X1,X2,X3,X4] :
( X2 != X4
& midpoint(X2,X4) = X1
& ~ s_e(X0,X2,X3,X4)
& s_e(X1,X2,X1,X4)
& s_e(X0,X1,X3,X1)
& s_r(X3,X1,X4)
& s_r(X0,X1,X2) )
=> ( sK2 != sK4
& sK1 = midpoint(sK2,sK4)
& ~ s_e(sK0,sK2,sK3,sK4)
& s_e(sK1,sK2,sK1,sK4)
& s_e(sK0,sK1,sK3,sK1)
& s_r(sK3,sK1,sK4)
& s_r(sK0,sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f415,plain,
( sK2 != sK4
& sK1 = midpoint(sK2,sK4)
& ~ s_e(sK0,sK2,sK3,sK4)
& s_e(sK1,sK2,sK1,sK4)
& s_e(sK0,sK1,sK3,sK1)
& s_r(sK3,sK1,sK4)
& s_r(sK0,sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f413,f414]) ).
fof(f417,plain,
! [X2,X3,X0,X1,X4,X5] :
( s_e(X2,X3,X4,X5)
| ~ s_e(X0,X1,X4,X5)
| ~ s_e(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f2]) ).
fof(f527,plain,
! [X2,X0,X1] :
( s(X1,X0) = X2
| ~ s_m(X0,X1,X2) ),
inference(cnf_transformation,[],[f301]) ).
fof(f528,plain,
! [X0,X1] : s(X0,s(X0,X1)) = X1,
inference(cnf_transformation,[],[f302]) ).
fof(f549,plain,
! [X2,X0,X1] :
( s_r(X0,X1,s(X1,X2))
| ~ s_r(X0,X1,X2) ),
inference(cnf_transformation,[],[f323]) ).
fof(f640,plain,
! [X2,X3,X0,X1] :
( s_e(X0,X2,X3,X2)
| ~ s_e(X0,X1,X3,X1)
| ~ s_r(X3,X1,X2)
| ~ s_r(X0,X1,X2) ),
inference(cnf_transformation,[],[f396]) ).
fof(f641,plain,
s_r(sK0,sK1,sK2),
inference(cnf_transformation,[],[f415]) ).
fof(f642,plain,
s_r(sK3,sK1,sK4),
inference(cnf_transformation,[],[f415]) ).
fof(f643,plain,
s_e(sK0,sK1,sK3,sK1),
inference(cnf_transformation,[],[f415]) ).
fof(f645,plain,
~ s_e(sK0,sK2,sK3,sK4),
inference(cnf_transformation,[],[f415]) ).
fof(f646,plain,
sK1 = midpoint(sK2,sK4),
inference(cnf_transformation,[],[f415]) ).
fof(f694,plain,
! [X2,X0,X1] :
( s_e(X0,X2,X0,s(X1,X2))
| ~ s_r(X0,X1,X2) ),
inference(cnf_transformation,[],[f408]) ).
cnf(c_50,plain,
( ~ s_e(X0,X1,X2,X3)
| ~ s_e(X0,X1,X4,X5)
| s_e(X2,X3,X4,X5) ),
inference(cnf_transformation,[],[f417]) ).
cnf(c_160,plain,
( ~ s_m(X0,X1,X2)
| s(X1,X0) = X2 ),
inference(cnf_transformation,[],[f527]) ).
cnf(c_161,plain,
s(X0,s(X0,X1)) = X1,
inference(cnf_transformation,[],[f528]) ).
cnf(c_182,plain,
( ~ s_r(X0,X1,X2)
| s_r(X0,X1,s(X1,X2)) ),
inference(cnf_transformation,[],[f549]) ).
cnf(c_273,plain,
( ~ s_e(X0,X1,X2,X1)
| ~ s_r(X0,X1,X3)
| ~ s_r(X2,X1,X3)
| s_e(X0,X3,X2,X3) ),
inference(cnf_transformation,[],[f640]) ).
cnf(c_275,negated_conjecture,
midpoint(sK2,sK4) = sK1,
inference(cnf_transformation,[],[f646]) ).
cnf(c_276,negated_conjecture,
~ s_e(sK0,sK2,sK3,sK4),
inference(cnf_transformation,[],[f645]) ).
cnf(c_278,negated_conjecture,
s_e(sK0,sK1,sK3,sK1),
inference(cnf_transformation,[],[f643]) ).
cnf(c_279,negated_conjecture,
s_r(sK3,sK1,sK4),
inference(cnf_transformation,[],[f642]) ).
cnf(c_280,negated_conjecture,
s_r(sK0,sK1,sK2),
inference(cnf_transformation,[],[f641]) ).
cnf(c_327,plain,
( ~ s_r(X0,X1,X2)
| s_e(X0,X2,X0,s(X1,X2)) ),
inference(cnf_transformation,[],[f694]) ).
cnf(c_470,plain,
( midpoint(X0,X1) != X2
| s(X2,X0) = X1 ),
inference(well_definedness,[status(thm)],[c_160]) ).
cnf(c_2219,plain,
s(midpoint(X0,X1),X0) = X1,
inference(unflattening,[status(thm)],[c_470]) ).
cnf(c_364877,plain,
s(sK1,sK2) = sK4,
inference(superposition,[status(thm)],[c_275,c_2219]) ).
cnf(c_364885,plain,
s(sK1,sK4) = sK2,
inference(superposition,[status(thm)],[c_364877,c_161]) ).
cnf(c_365114,plain,
( ~ s_r(X0,sK1,sK2)
| s_r(X0,sK1,sK4) ),
inference(superposition,[status(thm)],[c_364877,c_182]) ).
cnf(c_365156,plain,
s_r(sK0,sK1,sK4),
inference(superposition,[status(thm)],[c_280,c_365114]) ).
cnf(c_365277,plain,
( ~ s_r(X0,sK1,sK4)
| s_e(X0,sK4,X0,sK2) ),
inference(superposition,[status(thm)],[c_364885,c_327]) ).
cnf(c_367137,plain,
( ~ s_r(sK0,sK1,X0)
| ~ s_r(sK3,sK1,X0)
| s_e(sK0,X0,sK3,X0) ),
inference(superposition,[status(thm)],[c_278,c_273]) ).
cnf(c_367386,plain,
( ~ s_e(sK0,X0,X1,X2)
| ~ s_r(sK0,sK1,X0)
| ~ s_r(sK3,sK1,X0)
| s_e(X1,X2,sK3,X0) ),
inference(superposition,[status(thm)],[c_367137,c_50]) ).
cnf(c_384741,plain,
( ~ s_r(sK0,sK1,sK4)
| ~ s_r(sK3,sK1,sK4)
| s_e(sK0,sK2,sK3,sK4) ),
inference(superposition,[status(thm)],[c_365277,c_367386]) ).
cnf(c_384837,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_384741,c_365156,c_276,c_279]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO526+1 : TPTP v8.1.2. Released v7.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n016.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 22:57:31 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 183.26/24.82 % SZS status Started for theBenchmark.p
% 183.26/24.82 % SZS status Theorem for theBenchmark.p
% 183.26/24.82
% 183.26/24.82 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 183.26/24.82
% 183.26/24.82 ------ iProver source info
% 183.26/24.82
% 183.26/24.82 git: date: 2023-05-31 18:12:56 +0000
% 183.26/24.82 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 183.26/24.82 git: non_committed_changes: false
% 183.26/24.82 git: last_make_outside_of_git: false
% 183.26/24.82
% 183.26/24.82 ------ Parsing...
% 183.26/24.82 ------ Clausification by vclausify_rel & Parsing by iProver...
% 183.26/24.82
% 183.26/24.82 ------ Preprocessing... sup_sim: 16 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 183.26/24.82
% 183.26/24.82 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 183.26/24.82
% 183.26/24.82 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 183.26/24.82 ------ Proving...
% 183.26/24.82 ------ Problem Properties
% 183.26/24.82
% 183.26/24.82
% 183.26/24.82 clauses 248
% 183.26/24.82 conjectures 7
% 183.26/24.82 EPR 150
% 183.26/24.82 Horn 173
% 183.26/24.82 unary 40
% 183.26/24.82 binary 90
% 183.26/24.82 lits 765
% 183.26/24.82 lits eq 169
% 183.26/24.82 fd_pure 0
% 183.26/24.82 fd_pseudo 0
% 183.26/24.82 fd_cond 0
% 183.26/24.82 fd_pseudo_cond 81
% 183.26/24.82 AC symbols 0
% 183.26/24.82
% 183.26/24.82 ------ Input Options Time Limit: Unbounded
% 183.26/24.82
% 183.26/24.82
% 183.26/24.82 ------
% 183.26/24.82 Current options:
% 183.26/24.82 ------
% 183.26/24.82
% 183.26/24.82
% 183.26/24.82
% 183.26/24.82
% 183.26/24.82 ------ Proving...
% 183.26/24.82
% 183.26/24.82
% 183.26/24.82 ------ Proving...
% 183.26/24.82
% 183.26/24.82
% 183.26/24.82 % SZS status Theorem for theBenchmark.p
% 183.26/24.82
% 183.26/24.82 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 183.26/24.82
% 183.26/24.83
%------------------------------------------------------------------------------