TSTP Solution File: SET073+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SET073+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n006.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:52 EDT 2023
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 58 ( 17 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 55 ( 22 ~; 18 |; 10 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 27 (; 23 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [U,X,Y] :
( member(U,unordered_pair(X,Y))
<=> ( member(U,universal_class)
& ( U = X
| U = Y ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,axiom,
! [X] : ~ member(X,null_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f44,conjecture,
! [X,Y] :
( member(X,universal_class)
=> unordered_pair(X,Y) != null_class ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f45,negated_conjecture,
~ ! [X,Y] :
( member(X,universal_class)
=> unordered_pair(X,Y) != 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(f96,plain,
! [X0] : ~ member(X0,null_class),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f191,plain,
? [X,Y] :
( member(X,universal_class)
& unordered_pair(X,Y) = null_class ),
inference(pre_NNF_transformation,[status(esa)],[f45]) ).
fof(f192,plain,
? [X] :
( member(X,universal_class)
& ? [Y] : unordered_pair(X,Y) = null_class ),
inference(miniscoping,[status(esa)],[f191]) ).
fof(f193,plain,
( member(sk0_7,universal_class)
& unordered_pair(sk0_7,sk0_8) = null_class ),
inference(skolemization,[status(esa)],[f192]) ).
fof(f194,plain,
member(sk0_7,universal_class),
inference(cnf_transformation,[status(esa)],[f193]) ).
fof(f195,plain,
unordered_pair(sk0_7,sk0_8) = null_class,
inference(cnf_transformation,[status(esa)],[f193]) ).
fof(f198,plain,
! [X0,X1] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
inference(destructive_equality_resolution,[status(esa)],[f63]) ).
fof(f209,plain,
( spl0_0
<=> member(sk0_7,null_class) ),
introduced(split_symbol_definition) ).
fof(f210,plain,
( member(sk0_7,null_class)
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f209]) ).
fof(f212,plain,
( spl0_1
<=> member(sk0_7,universal_class) ),
introduced(split_symbol_definition) ).
fof(f214,plain,
( ~ member(sk0_7,universal_class)
| spl0_1 ),
inference(component_clause,[status(thm)],[f212]) ).
fof(f215,plain,
( member(sk0_7,null_class)
| ~ member(sk0_7,universal_class) ),
inference(paramodulation,[status(thm)],[f195,f198]) ).
fof(f216,plain,
( spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f215,f209,f212]) ).
fof(f218,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f214,f194]) ).
fof(f219,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f218]) ).
fof(f220,plain,
( $false
| ~ spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f210,f96]) ).
fof(f221,plain,
~ spl0_0,
inference(contradiction_clause,[status(thm)],[f220]) ).
fof(f222,plain,
$false,
inference(sat_refutation,[status(thm)],[f216,f219,f221]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET073+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.06/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n006.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:18:17 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Drodi V3.5.1
% 0.12/0.37 % Refutation found
% 0.12/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.37 % Elapsed time: 0.025549 seconds
% 0.12/0.37 % CPU time: 0.034186 seconds
% 0.12/0.37 % Memory used: 15.003 MB
%------------------------------------------------------------------------------