TSTP Solution File: NUM590+3 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : NUM590+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 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 : Tue Apr 30 20:35:16 EDT 2024
% Result : Theorem 0.11s 0.28s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 8 unt; 0 def)
% Number of atoms : 101 ( 14 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 103 ( 30 ~; 24 |; 40 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 19 ( 18 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f82,hypothesis,
! [W0] :
( aElementOf0(W0,szNzAzT0)
=> ( aSet0(sdtlpdtrp0(xN,W0))
& ! [W1] :
( aElementOf0(W1,sdtlpdtrp0(xN,W0))
=> aElementOf0(W1,szNzAzT0) )
& aSubsetOf0(sdtlpdtrp0(xN,W0),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,W0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f90,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f91,hypothesis,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [W0] :
( aElementOf0(W0,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),W0) )
& aSet0(xY)
& ! [W0] :
( aElementOf0(W0,xY)
<=> ( aElement0(W0)
& aElementOf0(W0,sdtlpdtrp0(xN,xi))
& W0 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) )
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& xd = sdtlpdtrp0(xC,xi) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f92,conjecture,
( ! [W0] :
( aElementOf0(W0,xY)
=> aElementOf0(W0,szNzAzT0) )
| aSubsetOf0(xY,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f93,negated_conjecture,
~ ( ! [W0] :
( aElementOf0(W0,xY)
=> aElementOf0(W0,szNzAzT0) )
| aSubsetOf0(xY,szNzAzT0) ),
inference(negated_conjecture,[status(cth)],[f92]) ).
fof(f409,plain,
! [W0] :
( ~ aElementOf0(W0,szNzAzT0)
| ( aSet0(sdtlpdtrp0(xN,W0))
& ! [W1] :
( ~ aElementOf0(W1,sdtlpdtrp0(xN,W0))
| aElementOf0(W1,szNzAzT0) )
& aSubsetOf0(sdtlpdtrp0(xN,W0),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,W0)) ) ),
inference(pre_NNF_transformation,[status(esa)],[f82]) ).
fof(f411,plain,
! [X0,X1] :
( ~ aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,X0))
| aElementOf0(X1,szNzAzT0) ),
inference(cnf_transformation,[status(esa)],[f409]) ).
fof(f499,plain,
aElementOf0(xi,szNzAzT0),
inference(cnf_transformation,[status(esa)],[f90]) ).
fof(f500,plain,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [W0] :
( ~ aElementOf0(W0,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),W0) )
& aSet0(xY)
& ! [W0] :
( aElementOf0(W0,xY)
<=> ( aElement0(W0)
& aElementOf0(W0,sdtlpdtrp0(xN,xi))
& W0 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) )
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& xd = sdtlpdtrp0(xC,xi) ),
inference(pre_NNF_transformation,[status(esa)],[f91]) ).
fof(f501,plain,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [W0] :
( ~ aElementOf0(W0,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),W0) )
& aSet0(xY)
& ! [W0] :
( ( ~ aElementOf0(W0,xY)
| ( aElement0(W0)
& aElementOf0(W0,sdtlpdtrp0(xN,xi))
& W0 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) )
& ( aElementOf0(W0,xY)
| ~ aElement0(W0)
| ~ aElementOf0(W0,sdtlpdtrp0(xN,xi))
| W0 = szmzizndt0(sdtlpdtrp0(xN,xi)) ) )
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& xd = sdtlpdtrp0(xC,xi) ),
inference(NNF_transformation,[status(esa)],[f500]) ).
fof(f502,plain,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [W0] :
( ~ aElementOf0(W0,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),W0) )
& aSet0(xY)
& ! [W0] :
( ~ aElementOf0(W0,xY)
| ( aElement0(W0)
& aElementOf0(W0,sdtlpdtrp0(xN,xi))
& W0 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) )
& ! [W0] :
( aElementOf0(W0,xY)
| ~ aElement0(W0)
| ~ aElementOf0(W0,sdtlpdtrp0(xN,xi))
| W0 = szmzizndt0(sdtlpdtrp0(xN,xi)) )
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& xd = sdtlpdtrp0(xC,xi) ),
inference(miniscoping,[status(esa)],[f501]) ).
fof(f507,plain,
! [X0] :
( ~ aElementOf0(X0,xY)
| aElementOf0(X0,sdtlpdtrp0(xN,xi)) ),
inference(cnf_transformation,[status(esa)],[f502]) ).
fof(f512,plain,
( ? [W0] :
( aElementOf0(W0,xY)
& ~ aElementOf0(W0,szNzAzT0) )
& ~ aSubsetOf0(xY,szNzAzT0) ),
inference(pre_NNF_transformation,[status(esa)],[f93]) ).
fof(f513,plain,
( aElementOf0(sk0_27,xY)
& ~ aElementOf0(sk0_27,szNzAzT0)
& ~ aSubsetOf0(xY,szNzAzT0) ),
inference(skolemization,[status(esa)],[f512]) ).
fof(f514,plain,
aElementOf0(sk0_27,xY),
inference(cnf_transformation,[status(esa)],[f513]) ).
fof(f515,plain,
~ aElementOf0(sk0_27,szNzAzT0),
inference(cnf_transformation,[status(esa)],[f513]) ).
fof(f682,plain,
aElementOf0(sk0_27,sdtlpdtrp0(xN,xi)),
inference(resolution,[status(thm)],[f507,f514]) ).
fof(f701,plain,
( spl0_4
<=> aElementOf0(xi,szNzAzT0) ),
introduced(split_symbol_definition) ).
fof(f703,plain,
( ~ aElementOf0(xi,szNzAzT0)
| spl0_4 ),
inference(component_clause,[status(thm)],[f701]) ).
fof(f704,plain,
( spl0_5
<=> aElementOf0(sk0_27,szNzAzT0) ),
introduced(split_symbol_definition) ).
fof(f705,plain,
( aElementOf0(sk0_27,szNzAzT0)
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f704]) ).
fof(f707,plain,
( ~ aElementOf0(xi,szNzAzT0)
| aElementOf0(sk0_27,szNzAzT0) ),
inference(resolution,[status(thm)],[f411,f682]) ).
fof(f708,plain,
( ~ spl0_4
| spl0_5 ),
inference(split_clause,[status(thm)],[f707,f701,f704]) ).
fof(f1098,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f499,f703]) ).
fof(f1099,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f1098]) ).
fof(f1100,plain,
( $false
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f705,f515]) ).
fof(f1101,plain,
~ spl0_5,
inference(contradiction_clause,[status(thm)],[f1100]) ).
fof(f1102,plain,
$false,
inference(sat_refutation,[status(thm)],[f708,f1099,f1101]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : NUM590+3 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.08 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.07/0.26 % Computer : n012.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Mon Apr 29 20:39:11 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.11/0.28 % Drodi V3.6.0
% 0.11/0.28 % Refutation found
% 0.11/0.28 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.28 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.29 % Elapsed time: 0.022123 seconds
% 0.11/0.29 % CPU time: 0.046046 seconds
% 0.11/0.29 % Total memory used: 19.104 MB
% 0.11/0.29 % Net memory used: 19.042 MB
%------------------------------------------------------------------------------