TSTP Solution File: NUM613+3 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : NUM613+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n009.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:21 EDT 2024
% Result : Theorem 2.50s 0.75s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 65 ( 29 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 55 ( 20 ~; 18 |; 12 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 10 ( 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [W0,W1] :
( ( aElementOf0(W0,szNzAzT0)
& aElementOf0(W1,szNzAzT0) )
=> ( szszuzczcdt0(W0) = szszuzczcdt0(W1)
=> W0 = W1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f80,hypothesis,
( aElementOf0(xk,szNzAzT0)
& szszuzczcdt0(xk) = xK ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f99,hypothesis,
( aSet0(xQ)
& ! [W0] :
( aElementOf0(W0,xQ)
=> aElementOf0(W0,xO) )
& aSubsetOf0(xQ,xO)
& sbrdtbr0(xQ) = xK
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f109,hypothesis,
( sbrdtbr0(xQ) = szszuzczcdt0(xk)
& szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ)
& aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f110,conjecture,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f111,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(negated_conjecture,[status(cth)],[f110]) ).
fof(f194,plain,
! [W0,W1] :
( ~ aElementOf0(W0,szNzAzT0)
| ~ aElementOf0(W1,szNzAzT0)
| szszuzczcdt0(W0) != szszuzczcdt0(W1)
| W0 = W1 ),
inference(pre_NNF_transformation,[status(esa)],[f26]) ).
fof(f195,plain,
! [X0,X1] :
( ~ aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| szszuzczcdt0(X0) != szszuzczcdt0(X1)
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f194]) ).
fof(f406,plain,
aElementOf0(xk,szNzAzT0),
inference(cnf_transformation,[status(esa)],[f80]) ).
fof(f407,plain,
szszuzczcdt0(xk) = xK,
inference(cnf_transformation,[status(esa)],[f80]) ).
fof(f599,plain,
( aSet0(xQ)
& ! [W0] :
( ~ aElementOf0(W0,xQ)
| aElementOf0(W0,xO) )
& aSubsetOf0(xQ,xO)
& sbrdtbr0(xQ) = xK
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
inference(pre_NNF_transformation,[status(esa)],[f99]) ).
fof(f603,plain,
sbrdtbr0(xQ) = xK,
inference(cnf_transformation,[status(esa)],[f599]) ).
fof(f644,plain,
szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
inference(cnf_transformation,[status(esa)],[f109]) ).
fof(f645,plain,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(cnf_transformation,[status(esa)],[f109]) ).
fof(f646,plain,
sbrdtbr0(xP) != xk,
inference(cnf_transformation,[status(esa)],[f111]) ).
fof(f997,plain,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(backward_demodulation,[status(thm)],[f603,f644]) ).
fof(f3549,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| szszuzczcdt0(X0) != szszuzczcdt0(xk)
| X0 = xk ),
inference(resolution,[status(thm)],[f195,f406]) ).
fof(f3550,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| szszuzczcdt0(X0) != xK
| X0 = xk ),
inference(forward_demodulation,[status(thm)],[f407,f3549]) ).
fof(f3815,plain,
( spl0_321
<=> szszuzczcdt0(sbrdtbr0(xP)) = xK ),
introduced(split_symbol_definition) ).
fof(f3817,plain,
( szszuzczcdt0(sbrdtbr0(xP)) != xK
| spl0_321 ),
inference(component_clause,[status(thm)],[f3815]) ).
fof(f3818,plain,
( spl0_322
<=> sbrdtbr0(xP) = xk ),
introduced(split_symbol_definition) ).
fof(f3819,plain,
( sbrdtbr0(xP) = xk
| ~ spl0_322 ),
inference(component_clause,[status(thm)],[f3818]) ).
fof(f3821,plain,
( szszuzczcdt0(sbrdtbr0(xP)) != xK
| sbrdtbr0(xP) = xk ),
inference(resolution,[status(thm)],[f3550,f645]) ).
fof(f3822,plain,
( ~ spl0_321
| spl0_322 ),
inference(split_clause,[status(thm)],[f3821,f3815,f3818]) ).
fof(f3847,plain,
( xK != xK
| spl0_321 ),
inference(forward_demodulation,[status(thm)],[f997,f3817]) ).
fof(f3848,plain,
( $false
| spl0_321 ),
inference(trivial_equality_resolution,[status(esa)],[f3847]) ).
fof(f3849,plain,
spl0_321,
inference(contradiction_clause,[status(thm)],[f3848]) ).
fof(f3853,plain,
( $false
| ~ spl0_322 ),
inference(forward_subsumption_resolution,[status(thm)],[f3819,f646]) ).
fof(f3854,plain,
~ spl0_322,
inference(contradiction_clause,[status(thm)],[f3853]) ).
fof(f3855,plain,
$false,
inference(sat_refutation,[status(thm)],[f3822,f3849,f3854]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM613+3 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Apr 29 20:51:41 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.36 % Drodi V3.6.0
% 2.50/0.75 % Refutation found
% 2.50/0.75 % SZS status Theorem for theBenchmark: Theorem is valid
% 2.50/0.75 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 3.10/0.77 % Elapsed time: 0.425627 seconds
% 3.10/0.77 % CPU time: 3.142033 seconds
% 3.10/0.77 % Total memory used: 101.619 MB
% 3.10/0.77 % Net memory used: 100.399 MB
%------------------------------------------------------------------------------