TSTP Solution File: NUM605+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM605+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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 11:31:48 EDT 2023
% Result : Theorem 0.49s 1.16s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 49 ( 19 unt; 0 def)
% Number of atoms : 202 ( 74 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 249 ( 96 ~; 92 |; 47 &)
% ( 10 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 69 ( 0 sgn; 57 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( slcrc0 = X0
<=> ( ~ ? [X1] : aElementOf0(X1,X0)
& aSet0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).
fof(f42,axiom,
! [X0] :
( aSet0(X0)
=> ( sz00 = sbrdtbr0(X0)
<=> slcrc0 = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardEmpty) ).
fof(f57,axiom,
! [X0,X1] :
( ( aElementOf0(X1,szNzAzT0)
& aSet0(X0) )
=> ! [X2] :
( slbdtsldtrb0(X0,X1) = X2
<=> ( ! [X3] :
( aElementOf0(X3,X2)
<=> ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) ) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSel) ).
fof(f74,axiom,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3418) ).
fof(f79,axiom,
sz00 != xK,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3520) ).
fof(f96,axiom,
( isCountable0(xO)
& aSet0(xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4908) ).
fof(f99,axiom,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5078) ).
fof(f100,conjecture,
slcrc0 != xQ,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f101,negated_conjecture,
~ ( slcrc0 != xQ ),
inference(negated_conjecture,[],[f100]) ).
fof(f109,plain,
slcrc0 = xQ,
inference(flattening,[],[f101]) ).
fof(f111,plain,
! [X0] :
( slcrc0 = X0
<=> ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f160,plain,
! [X0] :
( ( sz00 = sbrdtbr0(X0)
<=> slcrc0 = X0 )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f184,plain,
! [X0,X1] :
( ! [X2] :
( slbdtsldtrb0(X0,X1) = X2
<=> ( ! [X3] :
( aElementOf0(X3,X2)
<=> ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) ) )
& aSet0(X2) ) )
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f185,plain,
! [X0,X1] :
( ! [X2] :
( slbdtsldtrb0(X0,X1) = X2
<=> ( ! [X3] :
( aElementOf0(X3,X2)
<=> ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) ) )
& aSet0(X2) ) )
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0) ),
inference(flattening,[],[f184]) ).
fof(f239,plain,
! [X0] :
( ( slcrc0 = X0
| ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0) )
& ( ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(nnf_transformation,[],[f111]) ).
fof(f240,plain,
! [X0] :
( ( slcrc0 = X0
| ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0) )
& ( ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(flattening,[],[f239]) ).
fof(f241,plain,
! [X0] :
( ( slcrc0 = X0
| ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0) )
& ( ( ! [X2] : ~ aElementOf0(X2,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(rectify,[],[f240]) ).
fof(f242,plain,
! [X0] :
( ? [X1] : aElementOf0(X1,X0)
=> aElementOf0(sK4(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f243,plain,
! [X0] :
( ( slcrc0 = X0
| aElementOf0(sK4(X0),X0)
| ~ aSet0(X0) )
& ( ( ! [X2] : ~ aElementOf0(X2,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f241,f242]) ).
fof(f265,plain,
! [X0] :
( ( ( sz00 = sbrdtbr0(X0)
| slcrc0 != X0 )
& ( slcrc0 = X0
| sz00 != sbrdtbr0(X0) ) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f160]) ).
fof(f288,plain,
! [X0,X1] :
( ! [X2] :
( ( slbdtsldtrb0(X0,X1) = X2
| ? [X3] :
( ( sbrdtbr0(X3) != X1
| ~ aSubsetOf0(X3,X0)
| ~ aElementOf0(X3,X2) )
& ( ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) )
| aElementOf0(X3,X2) ) )
| ~ aSet0(X2) )
& ( ( ! [X3] :
( ( aElementOf0(X3,X2)
| sbrdtbr0(X3) != X1
| ~ aSubsetOf0(X3,X0) )
& ( ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) )
| ~ aElementOf0(X3,X2) ) )
& aSet0(X2) )
| slbdtsldtrb0(X0,X1) != X2 ) )
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f185]) ).
fof(f289,plain,
! [X0,X1] :
( ! [X2] :
( ( slbdtsldtrb0(X0,X1) = X2
| ? [X3] :
( ( sbrdtbr0(X3) != X1
| ~ aSubsetOf0(X3,X0)
| ~ aElementOf0(X3,X2) )
& ( ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) )
| aElementOf0(X3,X2) ) )
| ~ aSet0(X2) )
& ( ( ! [X3] :
( ( aElementOf0(X3,X2)
| sbrdtbr0(X3) != X1
| ~ aSubsetOf0(X3,X0) )
& ( ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) )
| ~ aElementOf0(X3,X2) ) )
& aSet0(X2) )
| slbdtsldtrb0(X0,X1) != X2 ) )
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0) ),
inference(flattening,[],[f288]) ).
fof(f290,plain,
! [X0,X1] :
( ! [X2] :
( ( slbdtsldtrb0(X0,X1) = X2
| ? [X3] :
( ( sbrdtbr0(X3) != X1
| ~ aSubsetOf0(X3,X0)
| ~ aElementOf0(X3,X2) )
& ( ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) )
| aElementOf0(X3,X2) ) )
| ~ aSet0(X2) )
& ( ( ! [X4] :
( ( aElementOf0(X4,X2)
| sbrdtbr0(X4) != X1
| ~ aSubsetOf0(X4,X0) )
& ( ( sbrdtbr0(X4) = X1
& aSubsetOf0(X4,X0) )
| ~ aElementOf0(X4,X2) ) )
& aSet0(X2) )
| slbdtsldtrb0(X0,X1) != X2 ) )
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0) ),
inference(rectify,[],[f289]) ).
fof(f291,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( sbrdtbr0(X3) != X1
| ~ aSubsetOf0(X3,X0)
| ~ aElementOf0(X3,X2) )
& ( ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) )
| aElementOf0(X3,X2) ) )
=> ( ( sbrdtbr0(sK14(X0,X1,X2)) != X1
| ~ aSubsetOf0(sK14(X0,X1,X2),X0)
| ~ aElementOf0(sK14(X0,X1,X2),X2) )
& ( ( sbrdtbr0(sK14(X0,X1,X2)) = X1
& aSubsetOf0(sK14(X0,X1,X2),X0) )
| aElementOf0(sK14(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f292,plain,
! [X0,X1] :
( ! [X2] :
( ( slbdtsldtrb0(X0,X1) = X2
| ( ( sbrdtbr0(sK14(X0,X1,X2)) != X1
| ~ aSubsetOf0(sK14(X0,X1,X2),X0)
| ~ aElementOf0(sK14(X0,X1,X2),X2) )
& ( ( sbrdtbr0(sK14(X0,X1,X2)) = X1
& aSubsetOf0(sK14(X0,X1,X2),X0) )
| aElementOf0(sK14(X0,X1,X2),X2) ) )
| ~ aSet0(X2) )
& ( ( ! [X4] :
( ( aElementOf0(X4,X2)
| sbrdtbr0(X4) != X1
| ~ aSubsetOf0(X4,X0) )
& ( ( sbrdtbr0(X4) = X1
& aSubsetOf0(X4,X0) )
| ~ aElementOf0(X4,X2) ) )
& aSet0(X2) )
| slbdtsldtrb0(X0,X1) != X2 ) )
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14])],[f290,f291]) ).
fof(f325,plain,
! [X0] :
( aSet0(X0)
| slcrc0 != X0 ),
inference(cnf_transformation,[],[f243]) ).
fof(f392,plain,
! [X0] :
( sz00 = sbrdtbr0(X0)
| slcrc0 != X0
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f265]) ).
fof(f426,plain,
! [X2,X0,X1,X4] :
( sbrdtbr0(X4) = X1
| ~ aElementOf0(X4,X2)
| slbdtsldtrb0(X0,X1) != X2
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f292]) ).
fof(f469,plain,
aElementOf0(xK,szNzAzT0),
inference(cnf_transformation,[],[f74]) ).
fof(f480,plain,
sz00 != xK,
inference(cnf_transformation,[],[f79]) ).
fof(f517,plain,
aSet0(xO),
inference(cnf_transformation,[],[f96]) ).
fof(f523,plain,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
inference(cnf_transformation,[],[f99]) ).
fof(f524,plain,
slcrc0 = xQ,
inference(cnf_transformation,[],[f109]) ).
fof(f527,plain,
! [X0] :
( aSet0(X0)
| xQ != X0 ),
inference(definition_unfolding,[],[f325,f524]) ).
fof(f530,plain,
! [X0] :
( sz00 = sbrdtbr0(X0)
| xQ != X0
| ~ aSet0(X0) ),
inference(definition_unfolding,[],[f392,f524]) ).
fof(f545,plain,
aSet0(xQ),
inference(equality_resolution,[],[f527]) ).
fof(f551,plain,
( sz00 = sbrdtbr0(xQ)
| ~ aSet0(xQ) ),
inference(equality_resolution,[],[f530]) ).
fof(f563,plain,
! [X0,X1,X4] :
( sbrdtbr0(X4) = X1
| ~ aElementOf0(X4,slbdtsldtrb0(X0,X1))
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0) ),
inference(equality_resolution,[],[f426]) ).
cnf(c_52,negated_conjecture,
aSet0(xQ),
inference(cnf_transformation,[],[f545]) ).
cnf(c_116,negated_conjecture,
( ~ aSet0(xQ)
| sbrdtbr0(xQ) = sz00 ),
inference(cnf_transformation,[],[f551]) ).
cnf(c_153,plain,
( ~ aElementOf0(X0,slbdtsldtrb0(X1,X2))
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X1)
| sbrdtbr0(X0) = X2 ),
inference(cnf_transformation,[],[f563]) ).
cnf(c_194,plain,
aElementOf0(xK,szNzAzT0),
inference(cnf_transformation,[],[f469]) ).
cnf(c_205,plain,
sz00 != xK,
inference(cnf_transformation,[],[f480]) ).
cnf(c_243,plain,
aSet0(xO),
inference(cnf_transformation,[],[f517]) ).
cnf(c_248,plain,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
inference(cnf_transformation,[],[f523]) ).
cnf(c_389,negated_conjecture,
sbrdtbr0(xQ) = sz00,
inference(global_subsumption_just,[status(thm)],[c_116,c_52,c_116]) ).
cnf(c_8198,plain,
( ~ aElementOf0(xK,szNzAzT0)
| ~ aSet0(xO)
| sbrdtbr0(xQ) = xK ),
inference(superposition,[status(thm)],[c_248,c_153]) ).
cnf(c_8206,plain,
( ~ aElementOf0(xK,szNzAzT0)
| ~ aSet0(xO)
| sz00 = xK ),
inference(demodulation,[status(thm)],[c_8198,c_389]) ).
cnf(c_8277,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_8206,c_205,c_194,c_243]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM605+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 : Fri Aug 25 09:00:12 EDT 2023
% 0.12/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
% 0.49/1.16 % SZS status Started for theBenchmark.p
% 0.49/1.16 % SZS status Theorem for theBenchmark.p
% 0.49/1.16
% 0.49/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.49/1.16
% 0.49/1.16 ------ iProver source info
% 0.49/1.16
% 0.49/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.49/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.49/1.16 git: non_committed_changes: false
% 0.49/1.16 git: last_make_outside_of_git: false
% 0.49/1.16
% 0.49/1.16 ------ Parsing...
% 0.49/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.49/1.16
% 0.49/1.16 ------ Preprocessing... sup_sim: 0 pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 pe_s pe_e
% 0.49/1.16
% 0.49/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e scvd_s sp: 4 0s scvd_e snvd_s sp: 0 0s snvd_e
% 0.49/1.16
% 0.49/1.16 ------ Preprocessing...
% 0.49/1.16 ------ Proving...
% 0.49/1.16 ------ Problem Properties
% 0.49/1.16
% 0.49/1.16
% 0.49/1.16 clauses 199
% 0.49/1.16 conjectures 19
% 0.49/1.16 EPR 48
% 0.49/1.16 Horn 156
% 0.49/1.16 unary 37
% 0.49/1.16 binary 36
% 0.49/1.16 lits 664
% 0.49/1.16 lits eq 103
% 0.49/1.16 fd_pure 0
% 0.49/1.16 fd_pseudo 0
% 0.49/1.16 fd_cond 10
% 0.49/1.16 fd_pseudo_cond 25
% 0.49/1.16 AC symbols 0
% 0.49/1.16
% 0.49/1.16 ------ Input Options Time Limit: Unbounded
% 0.49/1.16
% 0.49/1.16
% 0.49/1.16 ------
% 0.49/1.16 Current options:
% 0.49/1.16 ------
% 0.49/1.16
% 0.49/1.16
% 0.49/1.16
% 0.49/1.16
% 0.49/1.16 ------ Proving...
% 0.49/1.16
% 0.49/1.16
% 0.49/1.16 % SZS status Theorem for theBenchmark.p
% 0.49/1.16
% 0.49/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.49/1.16
% 0.49/1.17
%------------------------------------------------------------------------------