TSTP Solution File: SET079+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SET079+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n016.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:33:53 EDT 2023
% Result : Theorem 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 9 unt; 0 def)
% Number of atoms : 60 ( 18 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 56 ( 23 ~; 19 |; 9 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 25 (; 24 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [U,X,Y] :
( member(U,unordered_pair(X,Y))
<=> ( member(U,universal_class)
& ( U = X
| U = Y ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X] : singleton(X) = unordered_pair(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,axiom,
! [X] : ~ member(X,null_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f44,conjecture,
! [X] :
( member(X,universal_class)
=> singleton(X) != null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f45,negated_conjecture,
~ ! [X] :
( member(X,universal_class)
=> singleton(X) != null_class ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f59,plain,
! [U,X,Y] :
( ( ~ member(U,unordered_pair(X,Y))
| ( member(U,universal_class)
& ( U = X
| U = Y ) ) )
& ( member(U,unordered_pair(X,Y))
| ~ member(U,universal_class)
| ( U != X
& U != Y ) ) ),
inference(NNF_transformation,[status(esa)],[f4]) ).
fof(f60,plain,
( ! [U,X,Y] :
( ~ member(U,unordered_pair(X,Y))
| ( member(U,universal_class)
& ( U = X
| U = Y ) ) )
& ! [U,X,Y] :
( member(U,unordered_pair(X,Y))
| ~ member(U,universal_class)
| ( U != X
& U != Y ) ) ),
inference(miniscoping,[status(esa)],[f59]) ).
fof(f63,plain,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f60]) ).
fof(f66,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f96,plain,
! [X0] : ~ member(X0,null_class),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f191,plain,
? [X] :
( member(X,universal_class)
& singleton(X) = null_class ),
inference(pre_NNF_transformation,[status(esa)],[f45]) ).
fof(f192,plain,
( member(sk0_7,universal_class)
& singleton(sk0_7) = null_class ),
inference(skolemization,[status(esa)],[f191]) ).
fof(f193,plain,
member(sk0_7,universal_class),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f194,plain,
singleton(sk0_7) = null_class,
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f197,plain,
! [X0,X1] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
inference(destructive_equality_resolution,[status(esa)],[f63]) ).
fof(f280,plain,
! [X0] :
( member(X0,singleton(X0))
| ~ member(X0,universal_class) ),
inference(paramodulation,[status(thm)],[f66,f197]) ).
fof(f598,plain,
( spl0_38
<=> member(sk0_7,universal_class) ),
introduced(split_symbol_definition) ).
fof(f600,plain,
( ~ member(sk0_7,universal_class)
| spl0_38 ),
inference(component_clause,[status(thm)],[f598]) ).
fof(f629,plain,
( spl0_43
<=> member(sk0_7,null_class) ),
introduced(split_symbol_definition) ).
fof(f630,plain,
( member(sk0_7,null_class)
| ~ spl0_43 ),
inference(component_clause,[status(thm)],[f629]) ).
fof(f632,plain,
( member(sk0_7,null_class)
| ~ member(sk0_7,universal_class) ),
inference(paramodulation,[status(thm)],[f194,f280]) ).
fof(f633,plain,
( spl0_43
| ~ spl0_38 ),
inference(split_clause,[status(thm)],[f632,f629,f598]) ).
fof(f634,plain,
( $false
| ~ spl0_43 ),
inference(forward_subsumption_resolution,[status(thm)],[f630,f96]) ).
fof(f635,plain,
~ spl0_43,
inference(contradiction_clause,[status(thm)],[f634]) ).
fof(f636,plain,
( $false
| spl0_38 ),
inference(forward_subsumption_resolution,[status(thm)],[f600,f193]) ).
fof(f637,plain,
spl0_38,
inference(contradiction_clause,[status(thm)],[f636]) ).
fof(f638,plain,
$false,
inference(sat_refutation,[status(thm)],[f633,f635,f637]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET079+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue May 30 10:42:59 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Drodi V3.5.1
% 0.19/0.58 % Refutation found
% 0.19/0.58 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.19/0.58 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.58 % Elapsed time: 0.019938 seconds
% 0.19/0.58 % CPU time: 0.070090 seconds
% 0.19/0.58 % Memory used: 15.371 MB
%------------------------------------------------------------------------------