TSTP Solution File: NUM550+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM550+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 1.66s 1.16s
% Output : CNFRefutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 11 unt; 0 def)
% Number of atoms : 91 ( 41 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 95 ( 38 ~; 25 |; 25 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn; 22 !; 8 ?)
% 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(f62,axiom,
( sz00 != xk
& aSet0(xT)
& aSet0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2202_02) ).
fof(f65,axiom,
( aElementOf0(xQ,slbdtsldtrb0(xS,xk))
& xk = sbrdtbr0(xQ)
& aSubsetOf0(xQ,xS)
& ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,xS) )
& aSet0(xQ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2270) ).
fof(f67,conjecture,
~ ( slcrc0 = xQ
& ~ ? [X0] : aElementOf0(X0,xQ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f68,negated_conjecture,
~ ~ ( slcrc0 = xQ
& ~ ? [X0] : aElementOf0(X0,xQ) ),
inference(negated_conjecture,[],[f67]) ).
fof(f76,plain,
( slcrc0 = xQ
& ~ ? [X0] : aElementOf0(X0,xQ) ),
inference(flattening,[],[f68]) ).
fof(f79,plain,
! [X0] :
( slcrc0 = X0
<=> ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f127,plain,
! [X0] :
( ( sz00 = sbrdtbr0(X0)
<=> slcrc0 = X0 )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f161,plain,
( aElementOf0(xQ,slbdtsldtrb0(xS,xk))
& xk = sbrdtbr0(xQ)
& aSubsetOf0(xQ,xS)
& ! [X0] :
( aElementOf0(X0,xS)
| ~ aElementOf0(X0,xQ) )
& aSet0(xQ) ),
inference(ennf_transformation,[],[f65]) ).
fof(f162,plain,
( slcrc0 = xQ
& ! [X0] : ~ aElementOf0(X0,xQ) ),
inference(ennf_transformation,[],[f76]) ).
fof(f169,plain,
! [X0] :
( ( slcrc0 = X0
| ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0) )
& ( ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(nnf_transformation,[],[f79]) ).
fof(f170,plain,
! [X0] :
( ( slcrc0 = X0
| ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0) )
& ( ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(flattening,[],[f169]) ).
fof(f171,plain,
! [X0] :
( ( slcrc0 = X0
| ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0) )
& ( ( ! [X2] : ~ aElementOf0(X2,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(rectify,[],[f170]) ).
fof(f172,plain,
! [X0] :
( ? [X1] : aElementOf0(X1,X0)
=> aElementOf0(sK4(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f173,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])],[f171,f172]) ).
fof(f195,plain,
! [X0] :
( ( ( sz00 = sbrdtbr0(X0)
| slcrc0 != X0 )
& ( slcrc0 = X0
| sz00 != sbrdtbr0(X0) ) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f127]) ).
fof(f230,plain,
! [X0] :
( aSet0(X0)
| slcrc0 != X0 ),
inference(cnf_transformation,[],[f173]) ).
fof(f296,plain,
! [X0] :
( sz00 = sbrdtbr0(X0)
| slcrc0 != X0
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f195]) ).
fof(f341,plain,
sz00 != xk,
inference(cnf_transformation,[],[f62]) ).
fof(f373,plain,
xk = sbrdtbr0(xQ),
inference(cnf_transformation,[],[f161]) ).
fof(f379,plain,
slcrc0 = xQ,
inference(cnf_transformation,[],[f162]) ).
fof(f382,plain,
! [X0] :
( aSet0(X0)
| xQ != X0 ),
inference(definition_unfolding,[],[f230,f379]) ).
fof(f385,plain,
! [X0] :
( sz00 = sbrdtbr0(X0)
| xQ != X0
| ~ aSet0(X0) ),
inference(definition_unfolding,[],[f296,f379]) ).
fof(f400,plain,
aSet0(xQ),
inference(equality_resolution,[],[f382]) ).
fof(f406,plain,
( sz00 = sbrdtbr0(xQ)
| ~ aSet0(xQ) ),
inference(equality_resolution,[],[f385]) ).
cnf(c_52,negated_conjecture,
aSet0(xQ),
inference(cnf_transformation,[],[f400]) ).
cnf(c_115,negated_conjecture,
( ~ aSet0(xQ)
| sbrdtbr0(xQ) = sz00 ),
inference(cnf_transformation,[],[f406]) ).
cnf(c_159,plain,
sz00 != xk,
inference(cnf_transformation,[],[f341]) ).
cnf(c_191,plain,
sbrdtbr0(xQ) = xk,
inference(cnf_transformation,[],[f373]) ).
cnf(c_296,negated_conjecture,
sbrdtbr0(xQ) = sz00,
inference(global_subsumption_just,[status(thm)],[c_115,c_52,c_115]) ).
cnf(c_1198,plain,
sz00 = xk,
inference(light_normalisation,[status(thm)],[c_191,c_296]) ).
cnf(c_1201,plain,
xk != xk,
inference(demodulation,[status(thm)],[c_159,c_1198]) ).
cnf(c_1202,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_1201]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM550+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n012.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri Aug 25 13:07:26 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.66/1.16 % SZS status Started for theBenchmark.p
% 1.66/1.16 % SZS status Theorem for theBenchmark.p
% 1.66/1.16
% 1.66/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.66/1.16
% 1.66/1.16 ------ iProver source info
% 1.66/1.16
% 1.66/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.66/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.66/1.16 git: non_committed_changes: false
% 1.66/1.16 git: last_make_outside_of_git: false
% 1.66/1.16
% 1.66/1.16 ------ Parsing...
% 1.66/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.66/1.16
% 1.66/1.16 ------ Preprocessing...
% 1.66/1.16
% 1.66/1.16 % SZS status Theorem for theBenchmark.p
% 1.66/1.16
% 1.66/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.66/1.16
% 1.66/1.16
%------------------------------------------------------------------------------