TSTP Solution File: SET017+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SET017+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 : Tue Apr 30 20:38:40 EDT 2024
% Result : Theorem 0.16s 0.32s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 9 unt; 0 def)
% Number of atoms : 90 ( 38 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 84 ( 29 ~; 29 |; 20 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 35 ( 29 !; 6 ?)
% 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(f44,conjecture,
! [X,Y,Z] :
( ( member(Y,universal_class)
& member(Z,universal_class)
& unordered_pair(X,Y) = unordered_pair(X,Z) )
=> Y = Z ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f45,negated_conjecture,
~ ! [X,Y,Z] :
( ( member(Y,universal_class)
& member(Z,universal_class)
& unordered_pair(X,Y) = unordered_pair(X,Z) )
=> Y = Z ),
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(f62,plain,
! [X0,X1,X2] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(cnf_transformation,[status(esa)],[f60]) ).
fof(f64,plain,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
| ~ member(X0,universal_class)
| X0 != X2 ),
inference(cnf_transformation,[status(esa)],[f60]) ).
fof(f191,plain,
? [X,Y,Z] :
( member(Y,universal_class)
& member(Z,universal_class)
& unordered_pair(X,Y) = unordered_pair(X,Z)
& Y != Z ),
inference(pre_NNF_transformation,[status(esa)],[f45]) ).
fof(f192,plain,
? [Y,Z] :
( member(Y,universal_class)
& member(Z,universal_class)
& ? [X] : unordered_pair(X,Y) = unordered_pair(X,Z)
& Y != Z ),
inference(miniscoping,[status(esa)],[f191]) ).
fof(f193,plain,
( member(sk0_7,universal_class)
& member(sk0_8,universal_class)
& unordered_pair(sk0_9,sk0_7) = unordered_pair(sk0_9,sk0_8)
& sk0_7 != sk0_8 ),
inference(skolemization,[status(esa)],[f192]) ).
fof(f194,plain,
member(sk0_7,universal_class),
inference(cnf_transformation,[status(esa)],[f193]) ).
fof(f195,plain,
member(sk0_8,universal_class),
inference(cnf_transformation,[status(esa)],[f193]) ).
fof(f196,plain,
unordered_pair(sk0_9,sk0_7) = unordered_pair(sk0_9,sk0_8),
inference(cnf_transformation,[status(esa)],[f193]) ).
fof(f197,plain,
sk0_7 != sk0_8,
inference(cnf_transformation,[status(esa)],[f193]) ).
fof(f201,plain,
! [X0,X1] :
( member(X0,unordered_pair(X1,X0))
| ~ member(X0,universal_class) ),
inference(destructive_equality_resolution,[status(esa)],[f64]) ).
fof(f206,plain,
! [X0] :
( ~ member(X0,unordered_pair(sk0_9,sk0_7))
| X0 = sk0_9
| X0 = sk0_8 ),
inference(paramodulation,[status(thm)],[f196,f62]) ).
fof(f229,plain,
! [X0] : member(sk0_8,unordered_pair(X0,sk0_8)),
inference(resolution,[status(thm)],[f201,f195]) ).
fof(f230,plain,
! [X0] : member(sk0_7,unordered_pair(X0,sk0_7)),
inference(resolution,[status(thm)],[f201,f194]) ).
fof(f234,plain,
member(sk0_8,unordered_pair(sk0_9,sk0_7)),
inference(paramodulation,[status(thm)],[f196,f229]) ).
fof(f238,plain,
( spl0_4
<=> sk0_8 = sk0_9 ),
introduced(split_symbol_definition) ).
fof(f239,plain,
( sk0_8 = sk0_9
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f238]) ).
fof(f241,plain,
( spl0_5
<=> sk0_8 = sk0_7 ),
introduced(split_symbol_definition) ).
fof(f242,plain,
( sk0_8 = sk0_7
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f241]) ).
fof(f244,plain,
( sk0_8 = sk0_9
| sk0_8 = sk0_7 ),
inference(resolution,[status(thm)],[f234,f62]) ).
fof(f245,plain,
( spl0_4
| spl0_5 ),
inference(split_clause,[status(thm)],[f244,f238,f241]) ).
fof(f259,plain,
( spl0_6
<=> sk0_7 = sk0_9 ),
introduced(split_symbol_definition) ).
fof(f260,plain,
( sk0_7 = sk0_9
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f259]) ).
fof(f262,plain,
( sk0_7 = sk0_9
| sk0_7 = sk0_8 ),
inference(resolution,[status(thm)],[f206,f230]) ).
fof(f263,plain,
( spl0_6
| spl0_5 ),
inference(split_clause,[status(thm)],[f262,f259,f241]) ).
fof(f264,plain,
( $false
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f242,f197]) ).
fof(f265,plain,
~ spl0_5,
inference(contradiction_clause,[status(thm)],[f264]) ).
fof(f307,plain,
( sk0_7 = sk0_8
| ~ spl0_4
| ~ spl0_6 ),
inference(forward_demodulation,[status(thm)],[f239,f260]) ).
fof(f308,plain,
( $false
| ~ spl0_4
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f307,f197]) ).
fof(f309,plain,
( ~ spl0_4
| ~ spl0_6 ),
inference(contradiction_clause,[status(thm)],[f308]) ).
fof(f310,plain,
$false,
inference(sat_refutation,[status(thm)],[f245,f263,f265,f309]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SET017+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.08/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n006.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Apr 29 21:35:50 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.32 % Drodi V3.6.0
% 0.16/0.32 % Refutation found
% 0.16/0.32 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.32 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.33 % Elapsed time: 0.018971 seconds
% 0.16/0.33 % CPU time: 0.029862 seconds
% 0.16/0.33 % Total memory used: 13.537 MB
% 0.16/0.33 % Net memory used: 13.516 MB
%------------------------------------------------------------------------------