TSTP Solution File: RNG102+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : RNG102+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n001.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 : Thu Aug 31 13:55:17 EDT 2023
% Result : Theorem 3.48s 1.14s
% Output : CNFRefutation 3.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 6 unt; 0 def)
% Number of atoms : 147 ( 48 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 187 ( 70 ~; 69 |; 40 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn; 46 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f37,axiom,
! [X0] :
( aElement0(X0)
=> ! [X1] :
( slsdtgt0(X0) = X1
<=> ( ! [X2] :
( aElementOf0(X2,X1)
<=> ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) ) )
& aSet0(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefPrIdeal) ).
fof(f38,axiom,
aElement0(xc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1905) ).
fof(f39,axiom,
( aElement0(xz)
& aElementOf0(xy,slsdtgt0(xc))
& aElementOf0(xx,slsdtgt0(xc)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1933) ).
fof(f41,conjecture,
? [X0] :
( xy = sdtasdt0(xc,X0)
& aElement0(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f42,negated_conjecture,
~ ? [X0] :
( xy = sdtasdt0(xc,X0)
& aElement0(X0) ),
inference(negated_conjecture,[],[f41]) ).
fof(f99,plain,
! [X0] :
( ! [X1] :
( slsdtgt0(X0) = X1
<=> ( ! [X2] :
( aElementOf0(X2,X1)
<=> ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) ) )
& aSet0(X1) ) )
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f100,plain,
! [X0] :
( xy != sdtasdt0(xc,X0)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f146,plain,
! [X0] :
( ! [X1] :
( ( slsdtgt0(X0) = X1
| ? [X2] :
( ( ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) )
| ~ aElementOf0(X2,X1) )
& ( ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) )
| aElementOf0(X2,X1) ) )
| ~ aSet0(X1) )
& ( ( ! [X2] :
( ( aElementOf0(X2,X1)
| ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) ) )
& ( ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) )
| ~ aElementOf0(X2,X1) ) )
& aSet0(X1) )
| slsdtgt0(X0) != X1 ) )
| ~ aElement0(X0) ),
inference(nnf_transformation,[],[f99]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ( slsdtgt0(X0) = X1
| ? [X2] :
( ( ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) )
| ~ aElementOf0(X2,X1) )
& ( ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) )
| aElementOf0(X2,X1) ) )
| ~ aSet0(X1) )
& ( ( ! [X2] :
( ( aElementOf0(X2,X1)
| ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) ) )
& ( ? [X3] :
( sdtasdt0(X0,X3) = X2
& aElement0(X3) )
| ~ aElementOf0(X2,X1) ) )
& aSet0(X1) )
| slsdtgt0(X0) != X1 ) )
| ~ aElement0(X0) ),
inference(flattening,[],[f146]) ).
fof(f148,plain,
! [X0] :
( ! [X1] :
( ( slsdtgt0(X0) = X1
| ? [X2] :
( ( ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) )
| ~ aElementOf0(X2,X1) )
& ( ? [X4] :
( sdtasdt0(X0,X4) = X2
& aElement0(X4) )
| aElementOf0(X2,X1) ) )
| ~ aSet0(X1) )
& ( ( ! [X5] :
( ( aElementOf0(X5,X1)
| ! [X6] :
( sdtasdt0(X0,X6) != X5
| ~ aElement0(X6) ) )
& ( ? [X7] :
( sdtasdt0(X0,X7) = X5
& aElement0(X7) )
| ~ aElementOf0(X5,X1) ) )
& aSet0(X1) )
| slsdtgt0(X0) != X1 ) )
| ~ aElement0(X0) ),
inference(rectify,[],[f147]) ).
fof(f149,plain,
! [X0,X1] :
( ? [X2] :
( ( ! [X3] :
( sdtasdt0(X0,X3) != X2
| ~ aElement0(X3) )
| ~ aElementOf0(X2,X1) )
& ( ? [X4] :
( sdtasdt0(X0,X4) = X2
& aElement0(X4) )
| aElementOf0(X2,X1) ) )
=> ( ( ! [X3] :
( sdtasdt0(X0,X3) != sK19(X0,X1)
| ~ aElement0(X3) )
| ~ aElementOf0(sK19(X0,X1),X1) )
& ( ? [X4] :
( sdtasdt0(X0,X4) = sK19(X0,X1)
& aElement0(X4) )
| aElementOf0(sK19(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
! [X0,X1] :
( ? [X4] :
( sdtasdt0(X0,X4) = sK19(X0,X1)
& aElement0(X4) )
=> ( sK19(X0,X1) = sdtasdt0(X0,sK20(X0,X1))
& aElement0(sK20(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
! [X0,X5] :
( ? [X7] :
( sdtasdt0(X0,X7) = X5
& aElement0(X7) )
=> ( sdtasdt0(X0,sK21(X0,X5)) = X5
& aElement0(sK21(X0,X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
! [X0] :
( ! [X1] :
( ( slsdtgt0(X0) = X1
| ( ( ! [X3] :
( sdtasdt0(X0,X3) != sK19(X0,X1)
| ~ aElement0(X3) )
| ~ aElementOf0(sK19(X0,X1),X1) )
& ( ( sK19(X0,X1) = sdtasdt0(X0,sK20(X0,X1))
& aElement0(sK20(X0,X1)) )
| aElementOf0(sK19(X0,X1),X1) ) )
| ~ aSet0(X1) )
& ( ( ! [X5] :
( ( aElementOf0(X5,X1)
| ! [X6] :
( sdtasdt0(X0,X6) != X5
| ~ aElement0(X6) ) )
& ( ( sdtasdt0(X0,sK21(X0,X5)) = X5
& aElement0(sK21(X0,X5)) )
| ~ aElementOf0(X5,X1) ) )
& aSet0(X1) )
| slsdtgt0(X0) != X1 ) )
| ~ aElement0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19,sK20,sK21])],[f148,f151,f150,f149]) ).
fof(f236,plain,
! [X0,X1,X5] :
( aElement0(sK21(X0,X5))
| ~ aElementOf0(X5,X1)
| slsdtgt0(X0) != X1
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f237,plain,
! [X0,X1,X5] :
( sdtasdt0(X0,sK21(X0,X5)) = X5
| ~ aElementOf0(X5,X1)
| slsdtgt0(X0) != X1
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f242,plain,
aElement0(xc),
inference(cnf_transformation,[],[f38]) ).
fof(f244,plain,
aElementOf0(xy,slsdtgt0(xc)),
inference(cnf_transformation,[],[f39]) ).
fof(f248,plain,
! [X0] :
( xy != sdtasdt0(xc,X0)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f258,plain,
! [X0,X5] :
( sdtasdt0(X0,sK21(X0,X5)) = X5
| ~ aElementOf0(X5,slsdtgt0(X0))
| ~ aElement0(X0) ),
inference(equality_resolution,[],[f237]) ).
fof(f259,plain,
! [X0,X5] :
( aElement0(sK21(X0,X5))
| ~ aElementOf0(X5,slsdtgt0(X0))
| ~ aElement0(X0) ),
inference(equality_resolution,[],[f236]) ).
cnf(c_135,plain,
( ~ aElementOf0(X0,slsdtgt0(X1))
| ~ aElement0(X1)
| sdtasdt0(X1,sK21(X1,X0)) = X0 ),
inference(cnf_transformation,[],[f258]) ).
cnf(c_136,plain,
( ~ aElementOf0(X0,slsdtgt0(X1))
| ~ aElement0(X1)
| aElement0(sK21(X1,X0)) ),
inference(cnf_transformation,[],[f259]) ).
cnf(c_138,plain,
aElement0(xc),
inference(cnf_transformation,[],[f242]) ).
cnf(c_140,plain,
aElementOf0(xy,slsdtgt0(xc)),
inference(cnf_transformation,[],[f244]) ).
cnf(c_144,negated_conjecture,
( sdtasdt0(xc,X0) != xy
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f248]) ).
cnf(c_6964,plain,
( ~ aElementOf0(xy,slsdtgt0(xc))
| ~ aElement0(xc)
| aElement0(sK21(xc,xy)) ),
inference(instantiation,[status(thm)],[c_136]) ).
cnf(c_7065,plain,
( ~ aElementOf0(xy,slsdtgt0(xc))
| ~ aElement0(xc)
| sdtasdt0(xc,sK21(xc,xy)) = xy ),
inference(instantiation,[status(thm)],[c_135]) ).
cnf(c_7530,plain,
( sdtasdt0(xc,sK21(xc,xy)) != xy
| ~ aElement0(sK21(xc,xy)) ),
inference(instantiation,[status(thm)],[c_144]) ).
cnf(c_7531,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_7530,c_7065,c_6964,c_140,c_138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG102+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n001.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 : Sun Aug 27 02:44:02 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.48/1.14 % SZS status Started for theBenchmark.p
% 3.48/1.14 % SZS status Theorem for theBenchmark.p
% 3.48/1.14
% 3.48/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.48/1.14
% 3.48/1.14 ------ iProver source info
% 3.48/1.14
% 3.48/1.14 git: date: 2023-05-31 18:12:56 +0000
% 3.48/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.48/1.14 git: non_committed_changes: false
% 3.48/1.14 git: last_make_outside_of_git: false
% 3.48/1.14
% 3.48/1.14 ------ Parsing...
% 3.48/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.48/1.14
% 3.48/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 3.48/1.14
% 3.48/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.48/1.14
% 3.48/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.48/1.14 ------ Proving...
% 3.48/1.14 ------ Problem Properties
% 3.48/1.14
% 3.48/1.14
% 3.48/1.14 clauses 91
% 3.48/1.14 conjectures 1
% 3.48/1.14 EPR 15
% 3.48/1.14 Horn 68
% 3.48/1.14 unary 9
% 3.48/1.14 binary 15
% 3.48/1.14 lits 327
% 3.48/1.14 lits eq 44
% 3.48/1.14 fd_pure 0
% 3.48/1.14 fd_pseudo 0
% 3.48/1.14 fd_cond 3
% 3.48/1.14 fd_pseudo_cond 11
% 3.48/1.14 AC symbols 0
% 3.48/1.14
% 3.48/1.14 ------ Schedule dynamic 5 is on
% 3.48/1.14
% 3.48/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.48/1.14
% 3.48/1.14
% 3.48/1.14 ------
% 3.48/1.14 Current options:
% 3.48/1.14 ------
% 3.48/1.14
% 3.48/1.14
% 3.48/1.14
% 3.48/1.14
% 3.48/1.14 ------ Proving...
% 3.48/1.14
% 3.48/1.14
% 3.48/1.14 % SZS status Theorem for theBenchmark.p
% 3.48/1.14
% 3.48/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.48/1.14
% 3.48/1.14
%------------------------------------------------------------------------------