TSTP Solution File: SEU149+2 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SEU149+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n008.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:41:12 EDT 2024
% Result : Theorem 0.10s 0.33s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 103 ( 71 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 127 ( 46 ~; 48 |; 27 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 69 ( 59 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [A,B] :
( B = singleton(A)
<=> ! [C] :
( in(C,B)
<=> C = A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [A,B,C] :
( C = unordered_pair(A,B)
<=> ! [D] :
( in(D,C)
<=> ( D = A
| D = B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f72,conjecture,
! [A,B,C] :
( singleton(A) = unordered_pair(B,C)
=> A = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f73,negated_conjecture,
~ ! [A,B,C] :
( singleton(A) = unordered_pair(B,C)
=> A = B ),
inference(negated_conjecture,[status(cth)],[f72]) ).
fof(f86,plain,
! [A,B] :
( ( B != singleton(A)
| ! [C] :
( ( ~ in(C,B)
| C = A )
& ( in(C,B)
| C != A ) ) )
& ( B = singleton(A)
| ? [C] :
( ( ~ in(C,B)
| C != A )
& ( in(C,B)
| C = A ) ) ) ),
inference(NNF_transformation,[status(esa)],[f7]) ).
fof(f87,plain,
( ! [A,B] :
( B != singleton(A)
| ( ! [C] :
( ~ in(C,B)
| C = A )
& ! [C] :
( in(C,B)
| C != A ) ) )
& ! [A,B] :
( B = singleton(A)
| ? [C] :
( ( ~ in(C,B)
| C != A )
& ( in(C,B)
| C = A ) ) ) ),
inference(miniscoping,[status(esa)],[f86]) ).
fof(f88,plain,
( ! [A,B] :
( B != singleton(A)
| ( ! [C] :
( ~ in(C,B)
| C = A )
& ! [C] :
( in(C,B)
| C != A ) ) )
& ! [A,B] :
( B = singleton(A)
| ( ( ~ in(sk0_0(B,A),B)
| sk0_0(B,A) != A )
& ( in(sk0_0(B,A),B)
| sk0_0(B,A) = A ) ) ) ),
inference(skolemization,[status(esa)],[f87]) ).
fof(f89,plain,
! [X0,X1,X2] :
( X0 != singleton(X1)
| ~ in(X2,X0)
| X2 = X1 ),
inference(cnf_transformation,[status(esa)],[f88]) ).
fof(f105,plain,
! [A,B,C] :
( ( C != unordered_pair(A,B)
| ! [D] :
( ( ~ in(D,C)
| D = A
| D = B )
& ( in(D,C)
| ( D != A
& D != B ) ) ) )
& ( C = unordered_pair(A,B)
| ? [D] :
( ( ~ in(D,C)
| ( D != A
& D != B ) )
& ( in(D,C)
| D = A
| D = B ) ) ) ),
inference(NNF_transformation,[status(esa)],[f10]) ).
fof(f106,plain,
( ! [A,B,C] :
( C != unordered_pair(A,B)
| ( ! [D] :
( ~ in(D,C)
| D = A
| D = B )
& ! [D] :
( in(D,C)
| ( D != A
& D != B ) ) ) )
& ! [A,B,C] :
( C = unordered_pair(A,B)
| ? [D] :
( ( ~ in(D,C)
| ( D != A
& D != B ) )
& ( in(D,C)
| D = A
| D = B ) ) ) ),
inference(miniscoping,[status(esa)],[f105]) ).
fof(f107,plain,
( ! [A,B,C] :
( C != unordered_pair(A,B)
| ( ! [D] :
( ~ in(D,C)
| D = A
| D = B )
& ! [D] :
( in(D,C)
| ( D != A
& D != B ) ) ) )
& ! [A,B,C] :
( C = unordered_pair(A,B)
| ( ( ~ in(sk0_3(C,B,A),C)
| ( sk0_3(C,B,A) != A
& sk0_3(C,B,A) != B ) )
& ( in(sk0_3(C,B,A),C)
| sk0_3(C,B,A) = A
| sk0_3(C,B,A) = B ) ) ) ),
inference(skolemization,[status(esa)],[f106]) ).
fof(f109,plain,
! [X0,X1,X2,X3] :
( X0 != unordered_pair(X1,X2)
| in(X3,X0)
| X3 != X1 ),
inference(cnf_transformation,[status(esa)],[f107]) ).
fof(f268,plain,
? [A,B,C] :
( singleton(A) = unordered_pair(B,C)
& A != B ),
inference(pre_NNF_transformation,[status(esa)],[f73]) ).
fof(f269,plain,
? [A,B] :
( ? [C] : singleton(A) = unordered_pair(B,C)
& A != B ),
inference(miniscoping,[status(esa)],[f268]) ).
fof(f270,plain,
( singleton(sk0_13) = unordered_pair(sk0_14,sk0_15)
& sk0_13 != sk0_14 ),
inference(skolemization,[status(esa)],[f269]) ).
fof(f271,plain,
singleton(sk0_13) = unordered_pair(sk0_14,sk0_15),
inference(cnf_transformation,[status(esa)],[f270]) ).
fof(f272,plain,
sk0_13 != sk0_14,
inference(cnf_transformation,[status(esa)],[f270]) ).
fof(f275,plain,
! [X0,X1] :
( ~ in(X0,singleton(X1))
| X0 = X1 ),
inference(destructive_equality_resolution,[status(esa)],[f89]) ).
fof(f281,plain,
! [X0,X1] : in(X0,unordered_pair(X0,X1)),
inference(destructive_equality_resolution,[status(esa)],[f109]) ).
fof(f295,plain,
in(sk0_14,singleton(sk0_13)),
inference(paramodulation,[status(thm)],[f271,f281]) ).
fof(f303,plain,
sk0_14 = sk0_13,
inference(resolution,[status(thm)],[f275,f295]) ).
fof(f304,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f303,f272]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU149+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n008.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 19:45:27 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.32 % Drodi V3.6.0
% 0.10/0.33 % Refutation found
% 0.10/0.33 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.33 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.34 % Elapsed time: 0.019823 seconds
% 0.15/0.34 % CPU time: 0.024910 seconds
% 0.15/0.34 % Total memory used: 13.470 MB
% 0.15/0.34 % Net memory used: 13.460 MB
%------------------------------------------------------------------------------