TSTP Solution File: NUM393+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM393+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n032.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 : Wed May 31 12:29:01 EDT 2023
% Result : Theorem 0.09s 0.31s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 6 unt; 0 def)
% Number of atoms : 115 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 118 ( 46 ~; 47 |; 11 &)
% ( 7 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 42 (; 40 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [A,B] :
( ( ordinal(A)
& ordinal(B) )
=> ( ordinal_subset(A,B)
| ordinal_subset(B,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [A,B] :
( inclusion_comparable(A,B)
<=> ( subset(A,B)
| subset(B,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f24,axiom,
! [A,B] :
( ( ordinal(A)
& ordinal(B) )
=> ( ordinal_subset(A,B)
<=> subset(A,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f28,axiom,
! [A,B] :
( inclusion_comparable(A,B)
=> inclusion_comparable(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f30,conjecture,
! [A] :
( ordinal(A)
=> ! [B] :
( ordinal(B)
=> inclusion_comparable(A,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f31,negated_conjecture,
~ ! [A] :
( ordinal(A)
=> ! [B] :
( ordinal(B)
=> inclusion_comparable(A,B) ) ),
inference(negated_conjecture,[status(cth)],[f30]) ).
fof(f54,plain,
! [A,B] :
( ~ ordinal(A)
| ~ ordinal(B)
| ordinal_subset(A,B)
| ordinal_subset(B,A) ),
inference(pre_NNF_transformation,[status(esa)],[f7]) ).
fof(f55,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| ordinal_subset(X0,X1)
| ordinal_subset(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f54]) ).
fof(f56,plain,
! [A,B] :
( ( ~ inclusion_comparable(A,B)
| subset(A,B)
| subset(B,A) )
& ( inclusion_comparable(A,B)
| ( ~ subset(A,B)
& ~ subset(B,A) ) ) ),
inference(NNF_transformation,[status(esa)],[f8]) ).
fof(f57,plain,
( ! [A,B] :
( ~ inclusion_comparable(A,B)
| subset(A,B)
| subset(B,A) )
& ! [A,B] :
( inclusion_comparable(A,B)
| ( ~ subset(A,B)
& ~ subset(B,A) ) ) ),
inference(miniscoping,[status(esa)],[f56]) ).
fof(f60,plain,
! [X0,X1] :
( inclusion_comparable(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f57]) ).
fof(f105,plain,
! [A,B] :
( ~ ordinal(A)
| ~ ordinal(B)
| ( ordinal_subset(A,B)
<=> subset(A,B) ) ),
inference(pre_NNF_transformation,[status(esa)],[f24]) ).
fof(f106,plain,
! [A,B] :
( ~ ordinal(A)
| ~ ordinal(B)
| ( ( ~ ordinal_subset(A,B)
| subset(A,B) )
& ( ordinal_subset(A,B)
| ~ subset(A,B) ) ) ),
inference(NNF_transformation,[status(esa)],[f105]) ).
fof(f107,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| ~ ordinal_subset(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f106]) ).
fof(f116,plain,
! [A,B] :
( ~ inclusion_comparable(A,B)
| inclusion_comparable(B,A) ),
inference(pre_NNF_transformation,[status(esa)],[f28]) ).
fof(f117,plain,
! [X0,X1] :
( ~ inclusion_comparable(X0,X1)
| inclusion_comparable(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f116]) ).
fof(f120,plain,
? [A] :
( ordinal(A)
& ? [B] :
( ordinal(B)
& ~ inclusion_comparable(A,B) ) ),
inference(pre_NNF_transformation,[status(esa)],[f31]) ).
fof(f121,plain,
( ordinal(sk0_12)
& ordinal(sk0_13)
& ~ inclusion_comparable(sk0_12,sk0_13) ),
inference(skolemization,[status(esa)],[f120]) ).
fof(f122,plain,
ordinal(sk0_12),
inference(cnf_transformation,[status(esa)],[f121]) ).
fof(f123,plain,
ordinal(sk0_13),
inference(cnf_transformation,[status(esa)],[f121]) ).
fof(f124,plain,
~ inclusion_comparable(sk0_12,sk0_13),
inference(cnf_transformation,[status(esa)],[f121]) ).
fof(f176,plain,
! [X0] :
( ~ ordinal(X0)
| ordinal_subset(X0,sk0_13)
| ordinal_subset(sk0_13,X0) ),
inference(resolution,[status(thm)],[f55,f123]) ).
fof(f191,plain,
( spl0_7
<=> ordinal_subset(sk0_12,sk0_13) ),
introduced(split_symbol_definition) ).
fof(f194,plain,
( spl0_8
<=> ordinal_subset(sk0_13,sk0_12) ),
introduced(split_symbol_definition) ).
fof(f197,plain,
( ordinal_subset(sk0_12,sk0_13)
| ordinal_subset(sk0_13,sk0_12) ),
inference(resolution,[status(thm)],[f176,f122]) ).
fof(f198,plain,
( spl0_7
| spl0_8 ),
inference(split_clause,[status(thm)],[f197,f191,f194]) ).
fof(f225,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| ~ ordinal_subset(X0,X1)
| inclusion_comparable(X1,X0) ),
inference(resolution,[status(thm)],[f107,f60]) ).
fof(f228,plain,
! [X0] :
( ~ ordinal(X0)
| ~ ordinal_subset(X0,sk0_13)
| inclusion_comparable(sk0_13,X0) ),
inference(resolution,[status(thm)],[f225,f123]) ).
fof(f229,plain,
! [X0] :
( ~ ordinal(X0)
| ~ ordinal_subset(X0,sk0_12)
| inclusion_comparable(sk0_12,X0) ),
inference(resolution,[status(thm)],[f225,f122]) ).
fof(f230,plain,
! [X0] :
( ~ ordinal(X0)
| ~ ordinal_subset(X0,sk0_13)
| inclusion_comparable(X0,sk0_13) ),
inference(resolution,[status(thm)],[f228,f117]) ).
fof(f237,plain,
( spl0_13
<=> ordinal(sk0_12) ),
introduced(split_symbol_definition) ).
fof(f239,plain,
( ~ ordinal(sk0_12)
| spl0_13 ),
inference(component_clause,[status(thm)],[f237]) ).
fof(f247,plain,
( spl0_15
<=> ordinal(sk0_13) ),
introduced(split_symbol_definition) ).
fof(f249,plain,
( ~ ordinal(sk0_13)
| spl0_15 ),
inference(component_clause,[status(thm)],[f247]) ).
fof(f250,plain,
( ~ ordinal(sk0_13)
| ~ ordinal_subset(sk0_13,sk0_12) ),
inference(resolution,[status(thm)],[f229,f124]) ).
fof(f251,plain,
( ~ spl0_15
| ~ spl0_8 ),
inference(split_clause,[status(thm)],[f250,f247,f194]) ).
fof(f254,plain,
( $false
| spl0_15 ),
inference(forward_subsumption_resolution,[status(thm)],[f249,f123]) ).
fof(f255,plain,
spl0_15,
inference(contradiction_clause,[status(thm)],[f254]) ).
fof(f256,plain,
( $false
| spl0_13 ),
inference(forward_subsumption_resolution,[status(thm)],[f239,f122]) ).
fof(f257,plain,
spl0_13,
inference(contradiction_clause,[status(thm)],[f256]) ).
fof(f273,plain,
( ~ ordinal(sk0_12)
| ~ ordinal_subset(sk0_12,sk0_13) ),
inference(resolution,[status(thm)],[f230,f124]) ).
fof(f274,plain,
( ~ spl0_13
| ~ spl0_7 ),
inference(split_clause,[status(thm)],[f273,f237,f191]) ).
fof(f277,plain,
$false,
inference(sat_refutation,[status(thm)],[f198,f251,f255,f257,f274]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : NUM393+1 : TPTP v8.1.2. Released v3.2.0.
% 0.04/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n032.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue May 30 09:55:15 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.09/0.30 % Drodi V3.5.1
% 0.09/0.31 % Refutation found
% 0.09/0.31 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.31 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.53 % Elapsed time: 0.013293 seconds
% 0.15/0.53 % CPU time: 0.013298 seconds
% 0.15/0.53 % Memory used: 2.996 MB
%------------------------------------------------------------------------------