TSTP Solution File: NUM557+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM557+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:26 EDT 2023
% Result : Theorem 1.04s 1.19s
% Output : CNFRefutation 1.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 41 ( 10 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 43 ( 16 ~; 9 |; 14 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn; 4 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f72,axiom,
( xk = sbrdtbr0(xP)
& aSubsetOf0(xP,xS)
& ! [X0] :
( aElementOf0(X0,xP)
=> aElementOf0(X0,xS) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2431) ).
fof(f73,conjecture,
( aElementOf0(xP,slbdtsldtrb0(xS,xk))
| ( xk = sbrdtbr0(xP)
& ( aSubsetOf0(xP,xS)
| ! [X0] :
( aElementOf0(X0,xP)
=> aElementOf0(X0,xS) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f74,negated_conjecture,
~ ( aElementOf0(xP,slbdtsldtrb0(xS,xk))
| ( xk = sbrdtbr0(xP)
& ( aSubsetOf0(xP,xS)
| ! [X0] :
( aElementOf0(X0,xP)
=> aElementOf0(X0,xS) ) ) ) ),
inference(negated_conjecture,[],[f73]) ).
fof(f168,plain,
( xk = sbrdtbr0(xP)
& aSubsetOf0(xP,xS)
& ! [X0] :
( aElementOf0(X0,xS)
| ~ aElementOf0(X0,xP) ) ),
inference(ennf_transformation,[],[f72]) ).
fof(f169,plain,
( ~ aElementOf0(xP,slbdtsldtrb0(xS,xk))
& ( xk != sbrdtbr0(xP)
| ( ~ aSubsetOf0(xP,xS)
& ? [X0] :
( ~ aElementOf0(X0,xS)
& aElementOf0(X0,xP) ) ) ) ),
inference(ennf_transformation,[],[f74]) ).
fof(f240,plain,
( ? [X0] :
( ~ aElementOf0(X0,xS)
& aElementOf0(X0,xP) )
=> ( ~ aElementOf0(sK19,xS)
& aElementOf0(sK19,xP) ) ),
introduced(choice_axiom,[]) ).
fof(f241,plain,
( ~ aElementOf0(xP,slbdtsldtrb0(xS,xk))
& ( xk != sbrdtbr0(xP)
| ( ~ aSubsetOf0(xP,xS)
& ~ aElementOf0(sK19,xS)
& aElementOf0(sK19,xP) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19])],[f169,f240]) ).
fof(f413,plain,
aSubsetOf0(xP,xS),
inference(cnf_transformation,[],[f168]) ).
fof(f414,plain,
xk = sbrdtbr0(xP),
inference(cnf_transformation,[],[f168]) ).
fof(f417,plain,
( xk != sbrdtbr0(xP)
| ~ aSubsetOf0(xP,xS) ),
inference(cnf_transformation,[],[f241]) ).
cnf(c_219,plain,
sbrdtbr0(xP) = xk,
inference(cnf_transformation,[],[f414]) ).
cnf(c_220,plain,
aSubsetOf0(xP,xS),
inference(cnf_transformation,[],[f413]) ).
cnf(c_223,negated_conjecture,
( sbrdtbr0(xP) != xk
| ~ aSubsetOf0(xP,xS) ),
inference(cnf_transformation,[],[f417]) ).
cnf(c_249,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_223,c_219,c_220]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM557+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.16/0.35 % Computer : n012.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Fri Aug 25 15:08:26 EDT 2023
% 0.16/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.04/1.19 % SZS status Started for theBenchmark.p
% 1.04/1.19 % SZS status Theorem for theBenchmark.p
% 1.04/1.19
% 1.04/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.04/1.19
% 1.04/1.19 ------ iProver source info
% 1.04/1.19
% 1.04/1.19 git: date: 2023-05-31 18:12:56 +0000
% 1.04/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.04/1.19 git: non_committed_changes: false
% 1.04/1.19 git: last_make_outside_of_git: false
% 1.04/1.19
% 1.04/1.19 ------ Parsing...
% 1.04/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.04/1.19
% 1.04/1.19 ------ Preprocessing...
% 1.04/1.19
% 1.04/1.19 % SZS status Theorem for theBenchmark.p
% 1.04/1.19
% 1.04/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.04/1.19
% 1.04/1.19
%------------------------------------------------------------------------------