TSTP Solution File: NUM547+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM547+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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:21 EDT 2023
% Result : Theorem 3.39s 1.16s
% Output : CNFRefutation 3.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 14 unt; 0 def)
% Number of atoms : 176 ( 52 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 223 ( 85 ~; 79 |; 48 &)
% ( 8 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 66 ( 1 sgn; 51 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( slcrc0 = X0
<=> ( ~ ? [X1] : aElementOf0(X1,X0)
& aSet0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
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/sandbox2/benchmark/theBenchmark.p',mDefSel) ).
fof(f61,axiom,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2202) ).
fof(f62,axiom,
( sz00 != xk
& aSet0(xT)
& aSet0(xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2202_02) ).
fof(f63,axiom,
( slcrc0 != slbdtsldtrb0(xS,xk)
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2227) ).
fof(f65,conjecture,
? [X0] : aElementOf0(X0,slbdtsldtrb0(xS,xk)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f66,negated_conjecture,
~ ? [X0] : aElementOf0(X0,slbdtsldtrb0(xS,xk)),
inference(negated_conjecture,[],[f65]) ).
fof(f75,plain,
! [X0] :
( slcrc0 = X0
<=> ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f147,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(f148,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,[],[f147]) ).
fof(f155,plain,
! [X0] : ~ aElementOf0(X0,slbdtsldtrb0(xS,xk)),
inference(ennf_transformation,[],[f66]) ).
fof(f162,plain,
! [X0] :
( ( slcrc0 = X0
| ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0) )
& ( ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(nnf_transformation,[],[f75]) ).
fof(f163,plain,
! [X0] :
( ( slcrc0 = X0
| ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0) )
& ( ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(flattening,[],[f162]) ).
fof(f164,plain,
! [X0] :
( ( slcrc0 = X0
| ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0) )
& ( ( ! [X2] : ~ aElementOf0(X2,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(rectify,[],[f163]) ).
fof(f165,plain,
! [X0] :
( ? [X1] : aElementOf0(X1,X0)
=> aElementOf0(sK4(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f166,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])],[f164,f165]) ).
fof(f211,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,[],[f148]) ).
fof(f212,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,[],[f211]) ).
fof(f213,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,[],[f212]) ).
fof(f214,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(f215,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])],[f213,f214]) ).
fof(f219,plain,
! [X0] :
( slcrc0 = X0
| aElementOf0(sK4(X0),X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f166]) ).
fof(f315,plain,
! [X2,X0,X1] :
( aSet0(X2)
| slbdtsldtrb0(X0,X1) != X2
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f215]) ).
fof(f325,plain,
aElementOf0(xk,szNzAzT0),
inference(cnf_transformation,[],[f61]) ).
fof(f326,plain,
aSet0(xS),
inference(cnf_transformation,[],[f62]) ).
fof(f330,plain,
slcrc0 != slbdtsldtrb0(xS,xk),
inference(cnf_transformation,[],[f63]) ).
fof(f332,plain,
! [X0] : ~ aElementOf0(X0,slbdtsldtrb0(xS,xk)),
inference(cnf_transformation,[],[f155]) ).
fof(f354,plain,
! [X0,X1] :
( aSet0(slbdtsldtrb0(X0,X1))
| ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0) ),
inference(equality_resolution,[],[f315]) ).
cnf(c_50,plain,
( ~ aSet0(X0)
| X0 = slcrc0
| aElementOf0(sK4(X0),X0) ),
inference(cnf_transformation,[],[f219]) ).
cnf(c_154,plain,
( ~ aElementOf0(X0,szNzAzT0)
| ~ aSet0(X1)
| aSet0(slbdtsldtrb0(X1,X0)) ),
inference(cnf_transformation,[],[f354]) ).
cnf(c_158,plain,
aElementOf0(xk,szNzAzT0),
inference(cnf_transformation,[],[f325]) ).
cnf(c_161,plain,
aSet0(xS),
inference(cnf_transformation,[],[f326]) ).
cnf(c_162,plain,
slbdtsldtrb0(xS,xk) != slcrc0,
inference(cnf_transformation,[],[f330]) ).
cnf(c_165,negated_conjecture,
~ aElementOf0(X0,slbdtsldtrb0(xS,xk)),
inference(cnf_transformation,[],[f332]) ).
cnf(c_10765,plain,
( ~ aSet0(slbdtsldtrb0(xS,xk))
| slbdtsldtrb0(xS,xk) = slcrc0 ),
inference(superposition,[status(thm)],[c_50,c_165]) ).
cnf(c_10769,plain,
~ aSet0(slbdtsldtrb0(xS,xk)),
inference(forward_subsumption_resolution,[status(thm)],[c_10765,c_162]) ).
cnf(c_10929,plain,
( ~ aElementOf0(xk,szNzAzT0)
| ~ aSet0(xS) ),
inference(superposition,[status(thm)],[c_154,c_10769]) ).
cnf(c_10930,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10929,c_161,c_158]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM547+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n005.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 17:02:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.39/1.16 % SZS status Started for theBenchmark.p
% 3.39/1.16 % SZS status Theorem for theBenchmark.p
% 3.39/1.16
% 3.39/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.39/1.16
% 3.39/1.16 ------ iProver source info
% 3.39/1.16
% 3.39/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.39/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.39/1.16 git: non_committed_changes: false
% 3.39/1.16 git: last_make_outside_of_git: false
% 3.39/1.16
% 3.39/1.16 ------ Parsing...
% 3.39/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.39/1.16
% 3.39/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
% 3.39/1.16
% 3.39/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.39/1.16
% 3.39/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.39/1.16 ------ Proving...
% 3.39/1.16 ------ Problem Properties
% 3.39/1.16
% 3.39/1.16
% 3.39/1.16 clauses 115
% 3.39/1.16 conjectures 1
% 3.39/1.16 EPR 34
% 3.39/1.16 Horn 85
% 3.39/1.16 unary 17
% 3.39/1.16 binary 16
% 3.39/1.16 lits 385
% 3.39/1.16 lits eq 57
% 3.39/1.16 fd_pure 0
% 3.39/1.16 fd_pseudo 0
% 3.39/1.16 fd_cond 9
% 3.39/1.16 fd_pseudo_cond 18
% 3.39/1.16 AC symbols 0
% 3.39/1.16
% 3.39/1.16 ------ Schedule dynamic 5 is on
% 3.39/1.16
% 3.39/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.39/1.16
% 3.39/1.16
% 3.39/1.16 ------
% 3.39/1.16 Current options:
% 3.39/1.16 ------
% 3.39/1.16
% 3.39/1.16
% 3.39/1.16
% 3.39/1.16
% 3.39/1.16 ------ Proving...
% 3.39/1.16
% 3.39/1.16
% 3.39/1.16 % SZS status Theorem for theBenchmark.p
% 3.39/1.16
% 3.39/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.39/1.16
% 3.39/1.16
%------------------------------------------------------------------------------