TSTP Solution File: NUM609+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM609+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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:50:10 EDT 2024
% Result : Theorem 7.73s 1.68s
% Output : CNFRefutation 7.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 74 ( 12 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 81 ( 25 ~; 15 |; 33 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 13 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f104,axiom,
( xP = sdtmndt0(xQ,szmzizndt0(xQ))
& ! [X0] :
( aElementOf0(X0,xP)
<=> ( szmzizndt0(xQ) != X0
& aElementOf0(X0,xQ)
& aElement0(X0) ) )
& ! [X0] :
( aElementOf0(X0,xQ)
=> sdtlseqdt0(szmzizndt0(xQ),X0) )
& aSet0(xP) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5164) ).
fof(f107,conjecture,
( aSubsetOf0(xP,xQ)
| ! [X0] :
( aElementOf0(X0,xP)
=> aElementOf0(X0,xQ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f108,negated_conjecture,
~ ( aSubsetOf0(xP,xQ)
| ! [X0] :
( aElementOf0(X0,xP)
=> aElementOf0(X0,xQ) ) ),
inference(negated_conjecture,[],[f107]) ).
fof(f130,plain,
( xP = sdtmndt0(xQ,szmzizndt0(xQ))
& ! [X0] :
( aElementOf0(X0,xP)
<=> ( szmzizndt0(xQ) != X0
& aElementOf0(X0,xQ)
& aElement0(X0) ) )
& ! [X1] :
( aElementOf0(X1,xQ)
=> sdtlseqdt0(szmzizndt0(xQ),X1) )
& aSet0(xP) ),
inference(rectify,[],[f104]) ).
fof(f265,plain,
( xP = sdtmndt0(xQ,szmzizndt0(xQ))
& ! [X0] :
( aElementOf0(X0,xP)
<=> ( szmzizndt0(xQ) != X0
& aElementOf0(X0,xQ)
& aElement0(X0) ) )
& ! [X1] :
( sdtlseqdt0(szmzizndt0(xQ),X1)
| ~ aElementOf0(X1,xQ) )
& aSet0(xP) ),
inference(ennf_transformation,[],[f130]) ).
fof(f266,plain,
( ~ aSubsetOf0(xP,xQ)
& ? [X0] :
( ~ aElementOf0(X0,xQ)
& aElementOf0(X0,xP) ) ),
inference(ennf_transformation,[],[f108]) ).
fof(f493,plain,
( xP = sdtmndt0(xQ,szmzizndt0(xQ))
& ! [X0] :
( ( aElementOf0(X0,xP)
| szmzizndt0(xQ) = X0
| ~ aElementOf0(X0,xQ)
| ~ aElement0(X0) )
& ( ( szmzizndt0(xQ) != X0
& aElementOf0(X0,xQ)
& aElement0(X0) )
| ~ aElementOf0(X0,xP) ) )
& ! [X1] :
( sdtlseqdt0(szmzizndt0(xQ),X1)
| ~ aElementOf0(X1,xQ) )
& aSet0(xP) ),
inference(nnf_transformation,[],[f265]) ).
fof(f494,plain,
( xP = sdtmndt0(xQ,szmzizndt0(xQ))
& ! [X0] :
( ( aElementOf0(X0,xP)
| szmzizndt0(xQ) = X0
| ~ aElementOf0(X0,xQ)
| ~ aElement0(X0) )
& ( ( szmzizndt0(xQ) != X0
& aElementOf0(X0,xQ)
& aElement0(X0) )
| ~ aElementOf0(X0,xP) ) )
& ! [X1] :
( sdtlseqdt0(szmzizndt0(xQ),X1)
| ~ aElementOf0(X1,xQ) )
& aSet0(xP) ),
inference(flattening,[],[f493]) ).
fof(f497,plain,
( ? [X0] :
( ~ aElementOf0(X0,xQ)
& aElementOf0(X0,xP) )
=> ( ~ aElementOf0(sK73,xQ)
& aElementOf0(sK73,xP) ) ),
introduced(choice_axiom,[]) ).
fof(f498,plain,
( ~ aSubsetOf0(xP,xQ)
& ~ aElementOf0(sK73,xQ)
& aElementOf0(sK73,xP) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK73])],[f266,f497]) ).
fof(f912,plain,
! [X0] :
( aElementOf0(X0,xQ)
| ~ aElementOf0(X0,xP) ),
inference(cnf_transformation,[],[f494]) ).
fof(f919,plain,
aElementOf0(sK73,xP),
inference(cnf_transformation,[],[f498]) ).
fof(f920,plain,
~ aElementOf0(sK73,xQ),
inference(cnf_transformation,[],[f498]) ).
cnf(c_462,plain,
( ~ aElementOf0(X0,xP)
| aElementOf0(X0,xQ) ),
inference(cnf_transformation,[],[f912]) ).
cnf(c_470,negated_conjecture,
~ aElementOf0(sK73,xQ),
inference(cnf_transformation,[],[f920]) ).
cnf(c_471,negated_conjecture,
aElementOf0(sK73,xP),
inference(cnf_transformation,[],[f919]) ).
cnf(c_19527,plain,
aElementOf0(sK73,xQ),
inference(superposition,[status(thm)],[c_471,c_462]) ).
cnf(c_19528,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_470,c_19527]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM609+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 19:48:59 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.73/1.68 % SZS status Started for theBenchmark.p
% 7.73/1.68 % SZS status Theorem for theBenchmark.p
% 7.73/1.68
% 7.73/1.68 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.73/1.68
% 7.73/1.68 ------ iProver source info
% 7.73/1.68
% 7.73/1.68 git: date: 2024-05-02 19:28:25 +0000
% 7.73/1.68 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.73/1.68 git: non_committed_changes: false
% 7.73/1.68
% 7.73/1.68 ------ Parsing...
% 7.73/1.68 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.73/1.68
% 7.73/1.68 ------ 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
% 7.73/1.68
% 7.73/1.68 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.73/1.68
% 7.73/1.68 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.73/1.68 ------ Proving...
% 7.73/1.68 ------ Problem Properties
% 7.73/1.68
% 7.73/1.68
% 7.73/1.68 clauses 379
% 7.73/1.68 conjectures 3
% 7.73/1.68 EPR 74
% 7.73/1.68 Horn 304
% 7.73/1.68 unary 58
% 7.73/1.68 binary 102
% 7.73/1.68 lits 1180
% 7.73/1.68 lits eq 170
% 7.73/1.68 fd_pure 0
% 7.73/1.68 fd_pseudo 0
% 7.73/1.68 fd_cond 11
% 7.73/1.68 fd_pseudo_cond 39
% 7.73/1.68 AC symbols 0
% 7.73/1.68
% 7.73/1.68 ------ Input Options Time Limit: Unbounded
% 7.73/1.68
% 7.73/1.68
% 7.73/1.68 ------
% 7.73/1.68 Current options:
% 7.73/1.68 ------
% 7.73/1.68
% 7.73/1.68
% 7.73/1.68
% 7.73/1.68
% 7.73/1.68 ------ Proving...
% 7.73/1.68
% 7.73/1.68
% 7.73/1.68 % SZS status Theorem for theBenchmark.p
% 7.73/1.68
% 7.73/1.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.73/1.68
% 7.73/1.68
%------------------------------------------------------------------------------