TSTP Solution File: SET020+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SET020+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n027.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:36 EDT 2023
% Result : Theorem 0.10s 0.48s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 6 unt; 0 def)
% Number of atoms : 72 ( 25 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 69 ( 25 ~; 22 |; 15 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 17 (; 14 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X,Y] :
( ( member(X,universal_class)
& member(Y,universal_class) )
=> ( first(ordered_pair(X,Y)) = X
& second(ordered_pair(X,Y)) = Y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f44,conjecture,
! [U,V,X] :
( ( member(U,universal_class)
& member(V,universal_class)
& X = ordered_pair(U,V) )
=> ( first(X) = U
& second(X) = V ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f45,negated_conjecture,
~ ! [U,V,X] :
( ( member(U,universal_class)
& member(V,universal_class)
& X = ordered_pair(U,V) )
=> ( first(X) = U
& second(X) = V ) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f73,plain,
! [X,Y] :
( ~ member(X,universal_class)
| ~ member(Y,universal_class)
| ( first(ordered_pair(X,Y)) = X
& second(ordered_pair(X,Y)) = Y ) ),
inference(pre_NNF_transformation,[status(esa)],[f9]) ).
fof(f74,plain,
! [X0,X1] :
( ~ member(X0,universal_class)
| ~ member(X1,universal_class)
| first(ordered_pair(X0,X1)) = X0 ),
inference(cnf_transformation,[status(esa)],[f73]) ).
fof(f75,plain,
! [X0,X1] :
( ~ member(X0,universal_class)
| ~ member(X1,universal_class)
| second(ordered_pair(X0,X1)) = X1 ),
inference(cnf_transformation,[status(esa)],[f73]) ).
fof(f191,plain,
? [U,V,X] :
( member(U,universal_class)
& member(V,universal_class)
& X = ordered_pair(U,V)
& ( first(X) != U
| second(X) != V ) ),
inference(pre_NNF_transformation,[status(esa)],[f45]) ).
fof(f192,plain,
( member(sk0_7,universal_class)
& member(sk0_8,universal_class)
& sk0_9 = ordered_pair(sk0_7,sk0_8)
& ( first(sk0_9) != sk0_7
| second(sk0_9) != sk0_8 ) ),
inference(skolemization,[status(esa)],[f191]) ).
fof(f193,plain,
member(sk0_7,universal_class),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f194,plain,
member(sk0_8,universal_class),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f195,plain,
sk0_9 = ordered_pair(sk0_7,sk0_8),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f196,plain,
( first(sk0_9) != sk0_7
| second(sk0_9) != sk0_8 ),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f197,plain,
( spl0_0
<=> first(sk0_9) = sk0_7 ),
introduced(split_symbol_definition) ).
fof(f200,plain,
( spl0_1
<=> second(sk0_9) = sk0_8 ),
introduced(split_symbol_definition) ).
fof(f203,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f196,f197,f200]) ).
fof(f210,plain,
( spl0_2
<=> member(sk0_7,universal_class) ),
introduced(split_symbol_definition) ).
fof(f212,plain,
( ~ member(sk0_7,universal_class)
| spl0_2 ),
inference(component_clause,[status(thm)],[f210]) ).
fof(f213,plain,
( spl0_3
<=> member(sk0_8,universal_class) ),
introduced(split_symbol_definition) ).
fof(f215,plain,
( ~ member(sk0_8,universal_class)
| spl0_3 ),
inference(component_clause,[status(thm)],[f213]) ).
fof(f216,plain,
( ~ member(sk0_7,universal_class)
| ~ member(sk0_8,universal_class)
| first(sk0_9) = sk0_7 ),
inference(paramodulation,[status(thm)],[f195,f74]) ).
fof(f217,plain,
( ~ spl0_2
| ~ spl0_3
| spl0_0 ),
inference(split_clause,[status(thm)],[f216,f210,f213,f197]) ).
fof(f218,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f215,f194]) ).
fof(f219,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f218]) ).
fof(f220,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f212,f193]) ).
fof(f221,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f220]) ).
fof(f222,plain,
( ~ member(sk0_7,universal_class)
| ~ member(sk0_8,universal_class)
| second(sk0_9) = sk0_8 ),
inference(paramodulation,[status(thm)],[f195,f75]) ).
fof(f223,plain,
( ~ spl0_2
| ~ spl0_3
| spl0_1 ),
inference(split_clause,[status(thm)],[f222,f210,f213,f200]) ).
fof(f224,plain,
$false,
inference(sat_refutation,[status(thm)],[f203,f217,f219,f221,f223]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.06 % Problem : SET020+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.01/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.25 % Computer : n027.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Tue May 30 10:37:32 EDT 2023
% 0.06/0.25 % CPUTime :
% 0.10/0.26 % Drodi V3.5.1
% 0.10/0.48 % Refutation found
% 0.10/0.48 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.48 % Elapsed time: 0.016398 seconds
% 0.10/0.48 % CPU time: 0.023160 seconds
% 0.10/0.48 % Memory used: 15.017 MB
%------------------------------------------------------------------------------