TSTP Solution File: SEU126+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SEU126+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n004.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:35:53 EDT 2023
% Result : Theorem 0.21s 0.48s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 4 unt; 0 def)
% Number of atoms : 117 ( 20 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 132 ( 46 ~; 54 |; 23 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 65 (; 59 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [A,B,C] :
( C = set_union2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
| in(D,B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,conjecture,
! [A,B] :
( subset(A,B)
=> set_union2(A,B) = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,negated_conjecture,
~ ! [A,B] :
( subset(A,B)
=> set_union2(A,B) = B ),
inference(negated_conjecture,[status(cth)],[f15]) ).
fof(f29,plain,
! [A,B,C] :
( ( C != set_union2(A,B)
| ! [D] :
( ( ~ in(D,C)
| in(D,A)
| in(D,B) )
& ( in(D,C)
| ( ~ in(D,A)
& ~ in(D,B) ) ) ) )
& ( C = set_union2(A,B)
| ? [D] :
( ( ~ in(D,C)
| ( ~ in(D,A)
& ~ in(D,B) ) )
& ( in(D,C)
| in(D,A)
| in(D,B) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f4]) ).
fof(f30,plain,
( ! [A,B,C] :
( C != set_union2(A,B)
| ( ! [D] :
( ~ in(D,C)
| in(D,A)
| in(D,B) )
& ! [D] :
( in(D,C)
| ( ~ in(D,A)
& ~ in(D,B) ) ) ) )
& ! [A,B,C] :
( C = set_union2(A,B)
| ? [D] :
( ( ~ in(D,C)
| ( ~ in(D,A)
& ~ in(D,B) ) )
& ( in(D,C)
| in(D,A)
| in(D,B) ) ) ) ),
inference(miniscoping,[status(esa)],[f29]) ).
fof(f31,plain,
( ! [A,B,C] :
( C != set_union2(A,B)
| ( ! [D] :
( ~ in(D,C)
| in(D,A)
| in(D,B) )
& ! [D] :
( in(D,C)
| ( ~ in(D,A)
& ~ in(D,B) ) ) ) )
& ! [A,B,C] :
( C = set_union2(A,B)
| ( ( ~ in(sk0_0(C,B,A),C)
| ( ~ in(sk0_0(C,B,A),A)
& ~ in(sk0_0(C,B,A),B) ) )
& ( in(sk0_0(C,B,A),C)
| in(sk0_0(C,B,A),A)
| in(sk0_0(C,B,A),B) ) ) ) ),
inference(skolemization,[status(esa)],[f30]) ).
fof(f36,plain,
! [X0,X1,X2] :
( X0 = set_union2(X1,X2)
| ~ in(sk0_0(X0,X2,X1),X0)
| ~ in(sk0_0(X0,X2,X1),X2) ),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f37,plain,
! [X0,X1,X2] :
( X0 = set_union2(X1,X2)
| in(sk0_0(X0,X2,X1),X0)
| in(sk0_0(X0,X2,X1),X1)
| in(sk0_0(X0,X2,X1),X2) ),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f38,plain,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( ~ in(C,A)
| in(C,B) ) ),
inference(pre_NNF_transformation,[status(esa)],[f5]) ).
fof(f39,plain,
! [A,B] :
( ( ~ subset(A,B)
| ! [C] :
( ~ in(C,A)
| in(C,B) ) )
& ( subset(A,B)
| ? [C] :
( in(C,A)
& ~ in(C,B) ) ) ),
inference(NNF_transformation,[status(esa)],[f38]) ).
fof(f40,plain,
( ! [A,B] :
( ~ subset(A,B)
| ! [C] :
( ~ in(C,A)
| in(C,B) ) )
& ! [A,B] :
( subset(A,B)
| ? [C] :
( in(C,A)
& ~ in(C,B) ) ) ),
inference(miniscoping,[status(esa)],[f39]) ).
fof(f41,plain,
( ! [A,B] :
( ~ subset(A,B)
| ! [C] :
( ~ in(C,A)
| in(C,B) ) )
& ! [A,B] :
( subset(A,B)
| ( in(sk0_1(B,A),A)
& ~ in(sk0_1(B,A),B) ) ) ),
inference(skolemization,[status(esa)],[f40]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ~ subset(X0,X1)
| ~ in(X2,X0)
| in(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f41]) ).
fof(f60,plain,
? [A,B] :
( subset(A,B)
& set_union2(A,B) != B ),
inference(pre_NNF_transformation,[status(esa)],[f16]) ).
fof(f61,plain,
( subset(sk0_4,sk0_5)
& set_union2(sk0_4,sk0_5) != sk0_5 ),
inference(skolemization,[status(esa)],[f60]) ).
fof(f62,plain,
subset(sk0_4,sk0_5),
inference(cnf_transformation,[status(esa)],[f61]) ).
fof(f63,plain,
set_union2(sk0_4,sk0_5) != sk0_5,
inference(cnf_transformation,[status(esa)],[f61]) ).
fof(f86,plain,
! [X0] :
( ~ in(X0,sk0_4)
| in(X0,sk0_5) ),
inference(resolution,[status(thm)],[f42,f62]) ).
fof(f121,plain,
! [X0,X1] :
( X0 = set_union2(sk0_4,X1)
| in(sk0_0(X0,X1,sk0_4),X0)
| in(sk0_0(X0,X1,sk0_4),X1)
| in(sk0_0(X0,X1,sk0_4),sk0_5) ),
inference(resolution,[status(thm)],[f37,f86]) ).
fof(f263,plain,
( spl0_15
<=> sk0_5 = set_union2(sk0_4,sk0_5) ),
introduced(split_symbol_definition) ).
fof(f264,plain,
( sk0_5 = set_union2(sk0_4,sk0_5)
| ~ spl0_15 ),
inference(component_clause,[status(thm)],[f263]) ).
fof(f266,plain,
( spl0_16
<=> in(sk0_0(sk0_5,sk0_5,sk0_4),sk0_5) ),
introduced(split_symbol_definition) ).
fof(f268,plain,
( ~ in(sk0_0(sk0_5,sk0_5,sk0_4),sk0_5)
| spl0_16 ),
inference(component_clause,[status(thm)],[f266]) ).
fof(f269,plain,
( sk0_5 = set_union2(sk0_4,sk0_5)
| sk0_5 = set_union2(sk0_4,sk0_5)
| ~ in(sk0_0(sk0_5,sk0_5,sk0_4),sk0_5) ),
inference(resolution,[status(thm)],[f121,f36]) ).
fof(f270,plain,
( spl0_15
| ~ spl0_16 ),
inference(split_clause,[status(thm)],[f269,f263,f266]) ).
fof(f314,plain,
( $false
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[status(thm)],[f264,f63]) ).
fof(f315,plain,
~ spl0_15,
inference(contradiction_clause,[status(thm)],[f314]) ).
fof(f321,plain,
( sk0_5 = set_union2(sk0_4,sk0_5)
| spl0_16 ),
inference(resolution,[status(thm)],[f268,f121]) ).
fof(f322,plain,
( spl0_15
| spl0_16 ),
inference(split_clause,[status(thm)],[f321,f263,f266]) ).
fof(f344,plain,
$false,
inference(sat_refutation,[status(thm)],[f270,f315,f322]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU126+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue May 30 09:10:37 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % Drodi V3.5.1
% 0.21/0.48 % Refutation found
% 0.21/0.48 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.51 % Elapsed time: 0.154103 seconds
% 0.21/0.51 % CPU time: 0.267501 seconds
% 0.21/0.51 % Memory used: 41.154 MB
%------------------------------------------------------------------------------