TSTP Solution File: RNG101+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : RNG101+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n029.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:37:59 EDT 2024
% Result : Theorem 0.21s 0.42s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 6 unt; 1 def)
% Number of atoms : 122 ( 30 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 146 ( 56 ~; 56 |; 26 &)
% ( 7 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 47 ( 37 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f37,definition,
! [W0] :
( aElement0(W0)
=> ! [W1] :
( W1 = slsdtgt0(W0)
<=> ( aSet0(W1)
& ! [W2] :
( aElementOf0(W2,W1)
<=> ? [W3] :
( aElement0(W3)
& sdtasdt0(W0,W3) = W2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f38,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f39,hypothesis,
( aElementOf0(xx,slsdtgt0(xc))
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f40,conjecture,
? [W0] :
( aElement0(W0)
& sdtasdt0(xc,W0) = xx ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f41,negated_conjecture,
~ ? [W0] :
( aElement0(W0)
& sdtasdt0(xc,W0) = xx ),
inference(negated_conjecture,[status(cth)],[f40]) ).
fof(f181,plain,
! [W0] :
( ~ aElement0(W0)
| ! [W1] :
( W1 = slsdtgt0(W0)
<=> ( aSet0(W1)
& ! [W2] :
( aElementOf0(W2,W1)
<=> ? [W3] :
( aElement0(W3)
& sdtasdt0(W0,W3) = W2 ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f37]) ).
fof(f182,plain,
! [W0] :
( ~ aElement0(W0)
| ! [W1] :
( ( W1 != slsdtgt0(W0)
| ( aSet0(W1)
& ! [W2] :
( ( ~ aElementOf0(W2,W1)
| ? [W3] :
( aElement0(W3)
& sdtasdt0(W0,W3) = W2 ) )
& ( aElementOf0(W2,W1)
| ! [W3] :
( ~ aElement0(W3)
| sdtasdt0(W0,W3) != W2 ) ) ) ) )
& ( W1 = slsdtgt0(W0)
| ~ aSet0(W1)
| ? [W2] :
( ( ~ aElementOf0(W2,W1)
| ! [W3] :
( ~ aElement0(W3)
| sdtasdt0(W0,W3) != W2 ) )
& ( aElementOf0(W2,W1)
| ? [W3] :
( aElement0(W3)
& sdtasdt0(W0,W3) = W2 ) ) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f181]) ).
fof(f183,plain,
! [W0] :
( ~ aElement0(W0)
| ( ! [W1] :
( W1 != slsdtgt0(W0)
| ( aSet0(W1)
& ! [W2] :
( ~ aElementOf0(W2,W1)
| ? [W3] :
( aElement0(W3)
& sdtasdt0(W0,W3) = W2 ) )
& ! [W2] :
( aElementOf0(W2,W1)
| ! [W3] :
( ~ aElement0(W3)
| sdtasdt0(W0,W3) != W2 ) ) ) )
& ! [W1] :
( W1 = slsdtgt0(W0)
| ~ aSet0(W1)
| ? [W2] :
( ( ~ aElementOf0(W2,W1)
| ! [W3] :
( ~ aElement0(W3)
| sdtasdt0(W0,W3) != W2 ) )
& ( aElementOf0(W2,W1)
| ? [W3] :
( aElement0(W3)
& sdtasdt0(W0,W3) = W2 ) ) ) ) ) ),
inference(miniscoping,[status(esa)],[f182]) ).
fof(f184,plain,
! [W0] :
( ~ aElement0(W0)
| ( ! [W1] :
( W1 != slsdtgt0(W0)
| ( aSet0(W1)
& ! [W2] :
( ~ aElementOf0(W2,W1)
| ( aElement0(sk0_17(W2,W1,W0))
& sdtasdt0(W0,sk0_17(W2,W1,W0)) = W2 ) )
& ! [W2] :
( aElementOf0(W2,W1)
| ! [W3] :
( ~ aElement0(W3)
| sdtasdt0(W0,W3) != W2 ) ) ) )
& ! [W1] :
( W1 = slsdtgt0(W0)
| ~ aSet0(W1)
| ( ( ~ aElementOf0(sk0_18(W1,W0),W1)
| ! [W3] :
( ~ aElement0(W3)
| sdtasdt0(W0,W3) != sk0_18(W1,W0) ) )
& ( aElementOf0(sk0_18(W1,W0),W1)
| ( aElement0(sk0_19(W1,W0))
& sdtasdt0(W0,sk0_19(W1,W0)) = sk0_18(W1,W0) ) ) ) ) ) ),
inference(skolemization,[status(esa)],[f183]) ).
fof(f186,plain,
! [X0,X1,X2] :
( ~ aElement0(X0)
| X1 != slsdtgt0(X0)
| ~ aElementOf0(X2,X1)
| aElement0(sk0_17(X2,X1,X0)) ),
inference(cnf_transformation,[status(esa)],[f184]) ).
fof(f187,plain,
! [X0,X1,X2] :
( ~ aElement0(X0)
| X1 != slsdtgt0(X0)
| ~ aElementOf0(X2,X1)
| sdtasdt0(X0,sk0_17(X2,X1,X0)) = X2 ),
inference(cnf_transformation,[status(esa)],[f184]) ).
fof(f192,plain,
aElement0(xc),
inference(cnf_transformation,[status(esa)],[f38]) ).
fof(f193,plain,
aElementOf0(xx,slsdtgt0(xc)),
inference(cnf_transformation,[status(esa)],[f39]) ).
fof(f196,plain,
! [W0] :
( ~ aElement0(W0)
| sdtasdt0(xc,W0) != xx ),
inference(pre_NNF_transformation,[status(esa)],[f41]) ).
fof(f197,plain,
! [X0] :
( ~ aElement0(X0)
| sdtasdt0(xc,X0) != xx ),
inference(cnf_transformation,[status(esa)],[f196]) ).
fof(f220,plain,
! [X0,X1] :
( ~ aElement0(X0)
| ~ aElementOf0(X1,slsdtgt0(X0))
| aElement0(sk0_17(X1,slsdtgt0(X0),X0)) ),
inference(destructive_equality_resolution,[status(esa)],[f186]) ).
fof(f221,plain,
! [X0,X1] :
( ~ aElement0(X0)
| ~ aElementOf0(X1,slsdtgt0(X0))
| sdtasdt0(X0,sk0_17(X1,slsdtgt0(X0),X0)) = X1 ),
inference(destructive_equality_resolution,[status(esa)],[f187]) ).
fof(f306,plain,
( spl0_8
<=> aElement0(xc) ),
introduced(split_symbol_definition) ).
fof(f308,plain,
( ~ aElement0(xc)
| spl0_8 ),
inference(component_clause,[status(thm)],[f306]) ).
fof(f395,plain,
( spl0_14
<=> aElementOf0(xx,slsdtgt0(xc)) ),
introduced(split_symbol_definition) ).
fof(f397,plain,
( ~ aElementOf0(xx,slsdtgt0(xc))
| spl0_14 ),
inference(component_clause,[status(thm)],[f395]) ).
fof(f398,plain,
( spl0_15
<=> aElement0(sk0_17(xx,slsdtgt0(xc),xc)) ),
introduced(split_symbol_definition) ).
fof(f400,plain,
( ~ aElement0(sk0_17(xx,slsdtgt0(xc),xc))
| spl0_15 ),
inference(component_clause,[status(thm)],[f398]) ).
fof(f401,plain,
( ~ aElement0(xc)
| ~ aElementOf0(xx,slsdtgt0(xc))
| ~ aElement0(sk0_17(xx,slsdtgt0(xc),xc)) ),
inference(resolution,[status(thm)],[f221,f197]) ).
fof(f402,plain,
( ~ spl0_8
| ~ spl0_14
| ~ spl0_15 ),
inference(split_clause,[status(thm)],[f401,f306,f395,f398]) ).
fof(f406,plain,
( $false
| spl0_14 ),
inference(forward_subsumption_resolution,[status(thm)],[f397,f193]) ).
fof(f407,plain,
spl0_14,
inference(contradiction_clause,[status(thm)],[f406]) ).
fof(f408,plain,
( ~ aElement0(xc)
| ~ aElementOf0(xx,slsdtgt0(xc))
| spl0_15 ),
inference(resolution,[status(thm)],[f400,f220]) ).
fof(f409,plain,
( ~ spl0_8
| ~ spl0_14
| spl0_15 ),
inference(split_clause,[status(thm)],[f408,f306,f395,f398]) ).
fof(f410,plain,
( $false
| spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f308,f192]) ).
fof(f411,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f410]) ).
fof(f412,plain,
$false,
inference(sat_refutation,[status(thm)],[f402,f407,f409,f411]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : RNG101+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.35 % Computer : n029.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 : Mon Apr 29 22:37:20 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % Drodi V3.6.0
% 0.21/0.42 % Refutation found
% 0.21/0.42 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.44 % Elapsed time: 0.085080 seconds
% 0.21/0.44 % CPU time: 0.553048 seconds
% 0.21/0.44 % Total memory used: 59.873 MB
% 0.21/0.44 % Net memory used: 59.510 MB
%------------------------------------------------------------------------------