TSTP Solution File: NUM610+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM610+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:51 EDT 2023
% Result : Theorem 7.44s 1.65s
% Output : CNFRefutation 7.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 7 unt; 0 def)
% Number of atoms : 59 ( 5 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 59 ( 24 ~; 12 |; 16 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn; 11 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f100,axiom,
( ~ ( slcrc0 = xQ
| ~ ? [X0] : aElementOf0(X0,xQ) )
& ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,xO) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5093) ).
fof(f107,axiom,
( aSubsetOf0(xP,xQ)
& ! [X0] :
( aElementOf0(X0,xP)
=> aElementOf0(X0,xQ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5195) ).
fof(f108,conjecture,
( aSubsetOf0(xP,xO)
| ! [X0] :
( aElementOf0(X0,xP)
=> aElementOf0(X0,xO) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f109,negated_conjecture,
~ ( aSubsetOf0(xP,xO)
| ! [X0] :
( aElementOf0(X0,xP)
=> aElementOf0(X0,xO) ) ),
inference(negated_conjecture,[],[f108]) ).
fof(f129,plain,
( ~ ( slcrc0 = xQ
| ~ ? [X0] : aElementOf0(X0,xQ) )
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) ) ),
inference(rectify,[],[f100]) ).
fof(f261,plain,
( slcrc0 != xQ
& ? [X0] : aElementOf0(X0,xQ)
& ! [X1] :
( aElementOf0(X1,xO)
| ~ aElementOf0(X1,xQ) ) ),
inference(ennf_transformation,[],[f129]) ).
fof(f262,plain,
( slcrc0 != xQ
& ? [X0] : aElementOf0(X0,xQ)
& ! [X1] :
( aElementOf0(X1,xO)
| ~ aElementOf0(X1,xQ) ) ),
inference(flattening,[],[f261]) ).
fof(f267,plain,
( aSubsetOf0(xP,xQ)
& ! [X0] :
( aElementOf0(X0,xQ)
| ~ aElementOf0(X0,xP) ) ),
inference(ennf_transformation,[],[f107]) ).
fof(f268,plain,
( ~ aSubsetOf0(xP,xO)
& ? [X0] :
( ~ aElementOf0(X0,xO)
& aElementOf0(X0,xP) ) ),
inference(ennf_transformation,[],[f109]) ).
fof(f493,plain,
( ? [X0] : aElementOf0(X0,xQ)
=> aElementOf0(sK71,xQ) ),
introduced(choice_axiom,[]) ).
fof(f494,plain,
( slcrc0 != xQ
& aElementOf0(sK71,xQ)
& ! [X1] :
( aElementOf0(X1,xO)
| ~ aElementOf0(X1,xQ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK71])],[f262,f493]) ).
fof(f499,plain,
( ? [X0] :
( ~ aElementOf0(X0,xO)
& aElementOf0(X0,xP) )
=> ( ~ aElementOf0(sK73,xO)
& aElementOf0(sK73,xP) ) ),
introduced(choice_axiom,[]) ).
fof(f500,plain,
( ~ aSubsetOf0(xP,xO)
& ~ aElementOf0(sK73,xO)
& aElementOf0(sK73,xP) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK73])],[f268,f499]) ).
fof(f898,plain,
! [X1] :
( aElementOf0(X1,xO)
| ~ aElementOf0(X1,xQ) ),
inference(cnf_transformation,[],[f494]) ).
fof(f921,plain,
! [X0] :
( aElementOf0(X0,xQ)
| ~ aElementOf0(X0,xP) ),
inference(cnf_transformation,[],[f267]) ).
fof(f923,plain,
aElementOf0(sK73,xP),
inference(cnf_transformation,[],[f500]) ).
fof(f924,plain,
~ aElementOf0(sK73,xO),
inference(cnf_transformation,[],[f500]) ).
cnf(c_448,plain,
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,xO) ),
inference(cnf_transformation,[],[f898]) ).
cnf(c_470,plain,
( ~ aElementOf0(X0,xP)
| aElementOf0(X0,xQ) ),
inference(cnf_transformation,[],[f921]) ).
cnf(c_472,negated_conjecture,
~ aElementOf0(sK73,xO),
inference(cnf_transformation,[],[f924]) ).
cnf(c_473,negated_conjecture,
aElementOf0(sK73,xP),
inference(cnf_transformation,[],[f923]) ).
cnf(c_31538,plain,
aElementOf0(sK73,xQ),
inference(superposition,[status(thm)],[c_473,c_470]) ).
cnf(c_31552,plain,
aElementOf0(sK73,xO),
inference(superposition,[status(thm)],[c_31538,c_448]) ).
cnf(c_31553,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_31552,c_472]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM610+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.33 % Computer : n022.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Fri Aug 25 10:59:40 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.44/1.65 % SZS status Started for theBenchmark.p
% 7.44/1.65 % SZS status Theorem for theBenchmark.p
% 7.44/1.65
% 7.44/1.65 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.44/1.65
% 7.44/1.65 ------ iProver source info
% 7.44/1.65
% 7.44/1.65 git: date: 2023-05-31 18:12:56 +0000
% 7.44/1.65 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.44/1.65 git: non_committed_changes: false
% 7.44/1.65 git: last_make_outside_of_git: false
% 7.44/1.65
% 7.44/1.65 ------ Parsing...
% 7.44/1.65 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.44/1.65
% 7.44/1.65 ------ Preprocessing... sup_sim: 13 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 7.44/1.65
% 7.44/1.65 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.44/1.65
% 7.44/1.65 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.44/1.65 ------ Proving...
% 7.44/1.65 ------ Problem Properties
% 7.44/1.65
% 7.44/1.65
% 7.44/1.65 clauses 380
% 7.44/1.65 conjectures 3
% 7.44/1.65 EPR 75
% 7.44/1.65 Horn 305
% 7.44/1.65 unary 59
% 7.44/1.65 binary 102
% 7.44/1.65 lits 1181
% 7.44/1.65 lits eq 170
% 7.44/1.65 fd_pure 0
% 7.44/1.65 fd_pseudo 0
% 7.44/1.65 fd_cond 11
% 7.44/1.65 fd_pseudo_cond 39
% 7.44/1.65 AC symbols 0
% 7.44/1.65
% 7.44/1.65 ------ Schedule dynamic 5 is on
% 7.44/1.65
% 7.44/1.65 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.44/1.65
% 7.44/1.65
% 7.44/1.65 ------
% 7.44/1.65 Current options:
% 7.44/1.65 ------
% 7.44/1.65
% 7.44/1.65
% 7.44/1.65
% 7.44/1.65
% 7.44/1.65 ------ Proving...
% 7.44/1.65
% 7.44/1.65
% 7.44/1.65 % SZS status Theorem for theBenchmark.p
% 7.44/1.65
% 7.44/1.65 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.44/1.65
% 7.44/1.65
%------------------------------------------------------------------------------