TSTP Solution File: NUM551+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM551+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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 : Fri May 3 02:49:53 EDT 2024
% Result : Theorem 3.68s 1.17s
% Output : CNFRefutation 3.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 7 unt; 0 def)
% Number of atoms : 60 ( 6 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 58 ( 25 ~; 15 |; 14 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 11 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(f62,axiom,
( sz00 != xk
& aSet0(xT)
& aSet0(xS) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',m__2270) ).
fof(f67,axiom,
~ ( slcrc0 = xQ
| ~ ? [X0] : aElementOf0(X0,xQ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2313) ).
fof(f68,conjecture,
? [X0] :
( aElementOf0(X0,xQ)
& aElement0(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f69,negated_conjecture,
~ ? [X0] :
( aElementOf0(X0,xQ)
& aElement0(X0) ),
inference(negated_conjecture,[],[f68]) ).
fof(f78,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f3]) ).
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,[],[f67]) ).
fof(f163,plain,
! [X0] :
( ~ aElementOf0(X0,xQ)
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f69]) ).
fof(f230,plain,
( ? [X0] : aElementOf0(X0,xQ)
=> aElementOf0(sK19,xQ) ),
introduced(choice_axiom,[]) ).
fof(f231,plain,
( slcrc0 != xQ
& aElementOf0(sK19,xQ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19])],[f162,f230]) ).
fof(f232,plain,
! [X0,X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f342,plain,
aSet0(xS),
inference(cnf_transformation,[],[f62]) ).
fof(f374,plain,
! [X0] :
( aElementOf0(X0,xS)
| ~ aElementOf0(X0,xQ) ),
inference(cnf_transformation,[],[f161]) ).
fof(f381,plain,
aElementOf0(sK19,xQ),
inference(cnf_transformation,[],[f231]) ).
fof(f383,plain,
! [X0] :
( ~ aElementOf0(X0,xQ)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f163]) ).
cnf(c_49,plain,
( ~ aElementOf0(X0,X1)
| ~ aSet0(X1)
| aElement0(X0) ),
inference(cnf_transformation,[],[f232]) ).
cnf(c_161,plain,
aSet0(xS),
inference(cnf_transformation,[],[f342]) ).
cnf(c_193,plain,
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,xS) ),
inference(cnf_transformation,[],[f374]) ).
cnf(c_199,plain,
aElementOf0(sK19,xQ),
inference(cnf_transformation,[],[f381]) ).
cnf(c_200,negated_conjecture,
( ~ aElementOf0(X0,xQ)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f383]) ).
cnf(c_9424,negated_conjecture,
( ~ aElementOf0(X0,xQ)
| ~ aElement0(X0) ),
inference(demodulation,[status(thm)],[c_200]) ).
cnf(c_11441,plain,
~ aElement0(sK19),
inference(superposition,[status(thm)],[c_199,c_9424]) ).
cnf(c_11492,plain,
aElementOf0(sK19,xS),
inference(superposition,[status(thm)],[c_199,c_193]) ).
cnf(c_11553,plain,
( ~ aSet0(xS)
| aElement0(sK19) ),
inference(superposition,[status(thm)],[c_11492,c_49]) ).
cnf(c_11554,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11553,c_11441,c_161]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM551+3 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n026.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 : Thu May 2 19:45:06 EDT 2024
% 0.13/0.35 % 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.68/1.17 % SZS status Started for theBenchmark.p
% 3.68/1.17 % SZS status Theorem for theBenchmark.p
% 3.68/1.17
% 3.68/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.68/1.17
% 3.68/1.17 ------ iProver source info
% 3.68/1.17
% 3.68/1.17 git: date: 2024-05-02 19:28:25 +0000
% 3.68/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.68/1.17 git: non_committed_changes: false
% 3.68/1.17
% 3.68/1.17 ------ Parsing...
% 3.68/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.68/1.17
% 3.68/1.17 ------ 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.68/1.17
% 3.68/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.68/1.17
% 3.68/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.68/1.17 ------ Proving...
% 3.68/1.17 ------ Problem Properties
% 3.68/1.17
% 3.68/1.17
% 3.68/1.17 clauses 143
% 3.68/1.17 conjectures 1
% 3.68/1.17 EPR 41
% 3.68/1.17 Horn 110
% 3.68/1.17 unary 26
% 3.68/1.17 binary 25
% 3.68/1.17 lits 448
% 3.68/1.17 lits eq 69
% 3.68/1.17 fd_pure 0
% 3.68/1.17 fd_pseudo 0
% 3.68/1.17 fd_cond 9
% 3.68/1.17 fd_pseudo_cond 18
% 3.68/1.17 AC symbols 0
% 3.68/1.17
% 3.68/1.17 ------ Schedule dynamic 5 is on
% 3.68/1.17
% 3.68/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.68/1.17
% 3.68/1.17
% 3.68/1.17 ------
% 3.68/1.17 Current options:
% 3.68/1.17 ------
% 3.68/1.17
% 3.68/1.17
% 3.68/1.17
% 3.68/1.17
% 3.68/1.17 ------ Proving...
% 3.68/1.17
% 3.68/1.17
% 3.68/1.17 % SZS status Theorem for theBenchmark.p
% 3.68/1.17
% 3.68/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.68/1.17
% 3.68/1.17
%------------------------------------------------------------------------------