TSTP Solution File: NUM549+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM549+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:22 EDT 2023
% Result : Theorem 0.46s 1.16s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 13 unt; 0 def)
% Number of atoms : 109 ( 39 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 111 ( 46 ~; 40 |; 17 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 38 ( 0 sgn; 26 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(f5,axiom,
! [X0] :
( slcrc0 = X0
<=> ( ~ ? [X1] : aElementOf0(X1,X0)
& aSet0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
fof(f42,axiom,
! [X0] :
( aSet0(X0)
=> ( sz00 = sbrdtbr0(X0)
<=> slcrc0 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardEmpty) ).
fof(f62,axiom,
( sz00 != xk
& aSet0(xT)
& aSet0(xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2202_02) ).
fof(f66,axiom,
( xk = sbrdtbr0(xQ)
& isFinite0(xQ)
& aSet0(xQ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2291) ).
fof(f67,conjecture,
? [X0] :
( aElementOf0(X0,xQ)
& aElement0(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f68,negated_conjecture,
~ ? [X0] :
( aElementOf0(X0,xQ)
& aElement0(X0) ),
inference(negated_conjecture,[],[f67]) ).
fof(f76,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f77,plain,
! [X0] :
( slcrc0 = X0
<=> ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f125,plain,
! [X0] :
( ( sz00 = sbrdtbr0(X0)
<=> slcrc0 = X0 )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f157,plain,
! [X0] :
( ~ aElementOf0(X0,xQ)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f164,plain,
! [X0] :
( ( slcrc0 = X0
| ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0) )
& ( ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(nnf_transformation,[],[f77]) ).
fof(f165,plain,
! [X0] :
( ( slcrc0 = X0
| ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0) )
& ( ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(flattening,[],[f164]) ).
fof(f166,plain,
! [X0] :
( ( slcrc0 = X0
| ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0) )
& ( ( ! [X2] : ~ aElementOf0(X2,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(rectify,[],[f165]) ).
fof(f167,plain,
! [X0] :
( ? [X1] : aElementOf0(X1,X0)
=> aElementOf0(sK4(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f168,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])],[f166,f167]) ).
fof(f190,plain,
! [X0] :
( ( ( sz00 = sbrdtbr0(X0)
| slcrc0 != X0 )
& ( slcrc0 = X0
| sz00 != sbrdtbr0(X0) ) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f125]) ).
fof(f218,plain,
! [X0,X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f219,plain,
! [X0] :
( aSet0(X0)
| slcrc0 != X0 ),
inference(cnf_transformation,[],[f168]) ).
fof(f221,plain,
! [X0] :
( slcrc0 = X0
| aElementOf0(sK4(X0),X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f168]) ).
fof(f285,plain,
! [X0] :
( sz00 = sbrdtbr0(X0)
| slcrc0 != X0
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f190]) ).
fof(f330,plain,
sz00 != xk,
inference(cnf_transformation,[],[f62]) ).
fof(f335,plain,
aSet0(xQ),
inference(cnf_transformation,[],[f66]) ).
fof(f337,plain,
xk = sbrdtbr0(xQ),
inference(cnf_transformation,[],[f66]) ).
fof(f338,plain,
! [X0] :
( ~ aElementOf0(X0,xQ)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f340,plain,
aSet0(slcrc0),
inference(equality_resolution,[],[f219]) ).
fof(f346,plain,
( sz00 = sbrdtbr0(slcrc0)
| ~ aSet0(slcrc0) ),
inference(equality_resolution,[],[f285]) ).
cnf(c_49,plain,
( ~ aElementOf0(X0,X1)
| ~ aSet0(X1)
| aElement0(X0) ),
inference(cnf_transformation,[],[f218]) ).
cnf(c_50,plain,
( ~ aSet0(X0)
| X0 = slcrc0
| aElementOf0(sK4(X0),X0) ),
inference(cnf_transformation,[],[f221]) ).
cnf(c_52,plain,
aSet0(slcrc0),
inference(cnf_transformation,[],[f340]) ).
cnf(c_115,plain,
( ~ aSet0(slcrc0)
| sbrdtbr0(slcrc0) = sz00 ),
inference(cnf_transformation,[],[f346]) ).
cnf(c_159,plain,
sz00 != xk,
inference(cnf_transformation,[],[f330]) ).
cnf(c_166,plain,
sbrdtbr0(xQ) = xk,
inference(cnf_transformation,[],[f337]) ).
cnf(c_168,plain,
aSet0(xQ),
inference(cnf_transformation,[],[f335]) ).
cnf(c_169,negated_conjecture,
( ~ aElementOf0(X0,xQ)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f338]) ).
cnf(c_251,plain,
sbrdtbr0(slcrc0) = sz00,
inference(global_subsumption_just,[status(thm)],[c_115,c_52,c_115]) ).
cnf(c_11037,plain,
( ~ aSet0(X0)
| X0 = slcrc0
| aElement0(sK4(X0)) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_11045,plain,
( ~ aElement0(sK4(xQ))
| ~ aSet0(xQ)
| slcrc0 = xQ ),
inference(superposition,[status(thm)],[c_50,c_169]) ).
cnf(c_11049,plain,
( ~ aElement0(sK4(xQ))
| slcrc0 = xQ ),
inference(forward_subsumption_resolution,[status(thm)],[c_11045,c_168]) ).
cnf(c_11189,plain,
( ~ aSet0(xQ)
| slcrc0 = xQ ),
inference(superposition,[status(thm)],[c_11037,c_11049]) ).
cnf(c_11190,plain,
slcrc0 = xQ,
inference(forward_subsumption_resolution,[status(thm)],[c_11189,c_168]) ).
cnf(c_11193,plain,
sbrdtbr0(slcrc0) = xk,
inference(demodulation,[status(thm)],[c_166,c_11190]) ).
cnf(c_11198,plain,
sz00 = xk,
inference(light_normalisation,[status(thm)],[c_11193,c_251]) ).
cnf(c_11199,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11198,c_159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM549+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n009.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 : Fri Aug 25 13:41:51 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.46/1.16 % SZS status Started for theBenchmark.p
% 0.46/1.16 % SZS status Theorem for theBenchmark.p
% 0.46/1.16
% 0.46/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.46/1.16
% 0.46/1.16 ------ iProver source info
% 0.46/1.16
% 0.46/1.16 git: date: 2023-05-31 18:12:56 +0000
% 0.46/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.46/1.16 git: non_committed_changes: false
% 0.46/1.16 git: last_make_outside_of_git: false
% 0.46/1.16
% 0.46/1.16 ------ Parsing...
% 0.46/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.46/1.16
% 0.46/1.16 ------ 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: 1 0s sf_e pe_s pe_e
% 0.46/1.16
% 0.46/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.46/1.16
% 0.46/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.46/1.16 ------ Proving...
% 0.46/1.16 ------ Problem Properties
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 clauses 119
% 0.46/1.16 conjectures 1
% 0.46/1.16 EPR 37
% 0.46/1.16 Horn 89
% 0.46/1.16 unary 20
% 0.46/1.16 binary 17
% 0.46/1.16 lits 390
% 0.46/1.16 lits eq 58
% 0.46/1.16 fd_pure 0
% 0.46/1.16 fd_pseudo 0
% 0.46/1.16 fd_cond 9
% 0.46/1.16 fd_pseudo_cond 18
% 0.46/1.16 AC symbols 0
% 0.46/1.16
% 0.46/1.16 ------ Schedule dynamic 5 is on
% 0.46/1.16
% 0.46/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 ------
% 0.46/1.16 Current options:
% 0.46/1.16 ------
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 ------ Proving...
% 0.46/1.16
% 0.46/1.16
% 0.46/1.16 % SZS status Theorem for theBenchmark.p
% 0.46/1.16
% 0.46/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.16
% 0.46/1.16
%------------------------------------------------------------------------------