TSTP Solution File: SEU125+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SEU125+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n003.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.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 7 unt; 0 def)
% Number of atoms : 133 ( 8 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 149 ( 55 ~; 58 |; 27 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 72 (; 65 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [A,B,C] :
( C = set_union2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
| in(D,B) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,conjecture,
! [A,B,C] :
( ( subset(A,B)
& subset(C,B) )
=> subset(set_union2(A,C),B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,negated_conjecture,
~ ! [A,B,C] :
( ( subset(A,B)
& subset(C,B) )
=> subset(set_union2(A,C),B) ),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f23,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)],[f3]) ).
fof(f24,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)],[f23]) ).
fof(f25,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)],[f24]) ).
fof(f26,plain,
! [X0,X1,X2,X3] :
( X0 != set_union2(X1,X2)
| ~ in(X3,X0)
| in(X3,X1)
| in(X3,X2) ),
inference(cnf_transformation,[status(esa)],[f25]) ).
fof(f32,plain,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( ~ in(C,A)
| in(C,B) ) ),
inference(pre_NNF_transformation,[status(esa)],[f4]) ).
fof(f33,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)],[f32]) ).
fof(f34,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)],[f33]) ).
fof(f35,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)],[f34]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ~ subset(X0,X1)
| ~ in(X2,X0)
| in(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f35]) ).
fof(f37,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sk0_1(X1,X0),X0) ),
inference(cnf_transformation,[status(esa)],[f35]) ).
fof(f38,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sk0_1(X1,X0),X1) ),
inference(cnf_transformation,[status(esa)],[f35]) ).
fof(f63,plain,
? [A,B,C] :
( subset(A,B)
& subset(C,B)
& ~ subset(set_union2(A,C),B) ),
inference(pre_NNF_transformation,[status(esa)],[f19]) ).
fof(f64,plain,
( subset(sk0_4,sk0_5)
& subset(sk0_6,sk0_5)
& ~ subset(set_union2(sk0_4,sk0_6),sk0_5) ),
inference(skolemization,[status(esa)],[f63]) ).
fof(f65,plain,
subset(sk0_4,sk0_5),
inference(cnf_transformation,[status(esa)],[f64]) ).
fof(f66,plain,
subset(sk0_6,sk0_5),
inference(cnf_transformation,[status(esa)],[f64]) ).
fof(f67,plain,
~ subset(set_union2(sk0_4,sk0_6),sk0_5),
inference(cnf_transformation,[status(esa)],[f64]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ~ in(X0,set_union2(X1,X2))
| in(X0,X1)
| in(X0,X2) ),
inference(destructive_equality_resolution,[status(esa)],[f26]) ).
fof(f493,plain,
in(sk0_1(sk0_5,set_union2(sk0_4,sk0_6)),set_union2(sk0_4,sk0_6)),
inference(resolution,[status(thm)],[f37,f67]) ).
fof(f680,plain,
( spl0_26
<=> in(sk0_1(sk0_5,set_union2(sk0_4,sk0_6)),sk0_4) ),
introduced(split_symbol_definition) ).
fof(f681,plain,
( in(sk0_1(sk0_5,set_union2(sk0_4,sk0_6)),sk0_4)
| ~ spl0_26 ),
inference(component_clause,[status(thm)],[f680]) ).
fof(f683,plain,
( spl0_27
<=> in(sk0_1(sk0_5,set_union2(sk0_4,sk0_6)),sk0_6) ),
introduced(split_symbol_definition) ).
fof(f684,plain,
( in(sk0_1(sk0_5,set_union2(sk0_4,sk0_6)),sk0_6)
| ~ spl0_27 ),
inference(component_clause,[status(thm)],[f683]) ).
fof(f686,plain,
( in(sk0_1(sk0_5,set_union2(sk0_4,sk0_6)),sk0_4)
| in(sk0_1(sk0_5,set_union2(sk0_4,sk0_6)),sk0_6) ),
inference(resolution,[status(thm)],[f493,f68]) ).
fof(f687,plain,
( spl0_26
| spl0_27 ),
inference(split_clause,[status(thm)],[f686,f680,f683]) ).
fof(f855,plain,
! [X0] :
( ~ subset(sk0_4,X0)
| in(sk0_1(sk0_5,set_union2(sk0_4,sk0_6)),X0)
| ~ spl0_26 ),
inference(resolution,[status(thm)],[f681,f36]) ).
fof(f858,plain,
( in(sk0_1(sk0_5,set_union2(sk0_4,sk0_6)),sk0_5)
| ~ spl0_26 ),
inference(resolution,[status(thm)],[f855,f65]) ).
fof(f861,plain,
( subset(set_union2(sk0_4,sk0_6),sk0_5)
| ~ spl0_26 ),
inference(resolution,[status(thm)],[f858,f38]) ).
fof(f862,plain,
( $false
| ~ spl0_26 ),
inference(forward_subsumption_resolution,[status(thm)],[f861,f67]) ).
fof(f863,plain,
~ spl0_26,
inference(contradiction_clause,[status(thm)],[f862]) ).
fof(f865,plain,
! [X0] :
( ~ subset(sk0_6,X0)
| in(sk0_1(sk0_5,set_union2(sk0_4,sk0_6)),X0)
| ~ spl0_27 ),
inference(resolution,[status(thm)],[f684,f36]) ).
fof(f900,plain,
( in(sk0_1(sk0_5,set_union2(sk0_4,sk0_6)),sk0_5)
| ~ spl0_27 ),
inference(resolution,[status(thm)],[f865,f66]) ).
fof(f916,plain,
( subset(set_union2(sk0_4,sk0_6),sk0_5)
| ~ spl0_27 ),
inference(resolution,[status(thm)],[f900,f38]) ).
fof(f917,plain,
( $false
| ~ spl0_27 ),
inference(forward_subsumption_resolution,[status(thm)],[f916,f67]) ).
fof(f918,plain,
~ spl0_27,
inference(contradiction_clause,[status(thm)],[f917]) ).
fof(f919,plain,
$false,
inference(sat_refutation,[status(thm)],[f687,f863,f918]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU125+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32 % Computer : n003.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue May 30 09:16:38 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.11/0.33 % Drodi V3.5.1
% 0.16/0.45 % Refutation found
% 0.16/0.45 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.45 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.47 % Elapsed time: 0.136473 seconds
% 0.16/0.47 % CPU time: 0.719577 seconds
% 0.16/0.47 % Memory used: 59.422 MB
%------------------------------------------------------------------------------