TSTP Solution File: SEU128+2 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SEU128+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n011.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:54 EDT 2023
% Result : Theorem 171.81s 22.07s
% Output : CNFRefutation 172.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 6 unt; 0 def)
% Number of atoms : 126 ( 8 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 140 ( 49 ~; 55 |; 28 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 78 (; 71 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [A,B,C] :
( C = set_intersection2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f24,conjecture,
! [A,B,C] :
( ( subset(A,B)
& subset(A,C) )
=> subset(A,set_intersection2(B,C)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f25,negated_conjecture,
~ ! [A,B,C] :
( ( subset(A,B)
& subset(A,C) )
=> subset(A,set_intersection2(B,C)) ),
inference(negated_conjecture,[status(cth)],[f24]) ).
fof(f61,plain,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( ~ in(C,A)
| in(C,B) ) ),
inference(pre_NNF_transformation,[status(esa)],[f7]) ).
fof(f62,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)],[f61]) ).
fof(f63,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)],[f62]) ).
fof(f64,plain,
( ! [A,B] :
( ~ subset(A,B)
| ! [C] :
( ~ in(C,A)
| in(C,B) ) )
& ! [A,B] :
( subset(A,B)
| ( in(sk0_2(B,A),A)
& ~ in(sk0_2(B,A),B) ) ) ),
inference(skolemization,[status(esa)],[f63]) ).
fof(f65,plain,
! [X0,X1,X2] :
( ~ subset(X0,X1)
| ~ in(X2,X0)
| in(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f64]) ).
fof(f66,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sk0_2(X1,X0),X0) ),
inference(cnf_transformation,[status(esa)],[f64]) ).
fof(f67,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sk0_2(X1,X0),X1) ),
inference(cnf_transformation,[status(esa)],[f64]) ).
fof(f68,plain,
! [A,B,C] :
( ( C != set_intersection2(A,B)
| ! [D] :
( ( ~ in(D,C)
| ( in(D,A)
& in(D,B) ) )
& ( in(D,C)
| ~ in(D,A)
| ~ in(D,B) ) ) )
& ( C = set_intersection2(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)],[f8]) ).
fof(f69,plain,
( ! [A,B,C] :
( C != set_intersection2(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_intersection2(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)],[f68]) ).
fof(f70,plain,
( ! [A,B,C] :
( C != set_intersection2(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_intersection2(A,B)
| ( ( ~ in(sk0_3(C,B,A),C)
| ~ in(sk0_3(C,B,A),A)
| ~ in(sk0_3(C,B,A),B) )
& ( in(sk0_3(C,B,A),C)
| ( in(sk0_3(C,B,A),A)
& in(sk0_3(C,B,A),B) ) ) ) ) ),
inference(skolemization,[status(esa)],[f69]) ).
fof(f73,plain,
! [X0,X1,X2,X3] :
( X0 != set_intersection2(X1,X2)
| in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) ),
inference(cnf_transformation,[status(esa)],[f70]) ).
fof(f103,plain,
? [A,B,C] :
( subset(A,B)
& subset(A,C)
& ~ subset(A,set_intersection2(B,C)) ),
inference(pre_NNF_transformation,[status(esa)],[f25]) ).
fof(f104,plain,
( subset(sk0_6,sk0_7)
& subset(sk0_6,sk0_8)
& ~ subset(sk0_6,set_intersection2(sk0_7,sk0_8)) ),
inference(skolemization,[status(esa)],[f103]) ).
fof(f105,plain,
subset(sk0_6,sk0_7),
inference(cnf_transformation,[status(esa)],[f104]) ).
fof(f106,plain,
subset(sk0_6,sk0_8),
inference(cnf_transformation,[status(esa)],[f104]) ).
fof(f107,plain,
~ subset(sk0_6,set_intersection2(sk0_7,sk0_8)),
inference(cnf_transformation,[status(esa)],[f104]) ).
fof(f146,plain,
! [X0,X1,X2] :
( in(X0,set_intersection2(X1,X2))
| ~ in(X0,X1)
| ~ in(X0,X2) ),
inference(destructive_equality_resolution,[status(esa)],[f73]) ).
fof(f177,plain,
! [X0] :
( ~ in(X0,sk0_6)
| in(X0,sk0_8) ),
inference(resolution,[status(thm)],[f65,f106]) ).
fof(f178,plain,
! [X0] :
( ~ in(X0,sk0_6)
| in(X0,sk0_7) ),
inference(resolution,[status(thm)],[f65,f105]) ).
fof(f3073,plain,
! [X0] :
( subset(sk0_6,X0)
| in(sk0_2(X0,sk0_6),sk0_8) ),
inference(resolution,[status(thm)],[f66,f177]) ).
fof(f3074,plain,
! [X0] :
( subset(sk0_6,X0)
| in(sk0_2(X0,sk0_6),sk0_7) ),
inference(resolution,[status(thm)],[f66,f178]) ).
fof(f9996,plain,
! [X0,X1] :
( subset(sk0_6,X0)
| in(sk0_2(X0,sk0_6),set_intersection2(X1,sk0_8))
| ~ in(sk0_2(X0,sk0_6),X1) ),
inference(resolution,[status(thm)],[f3073,f146]) ).
fof(f38500,plain,
! [X0] :
( subset(sk0_6,X0)
| subset(sk0_6,X0)
| in(sk0_2(X0,sk0_6),set_intersection2(sk0_7,sk0_8)) ),
inference(resolution,[status(thm)],[f3074,f9996]) ).
fof(f38501,plain,
! [X0] :
( subset(sk0_6,X0)
| in(sk0_2(X0,sk0_6),set_intersection2(sk0_7,sk0_8)) ),
inference(duplicate_literals_removal,[status(esa)],[f38500]) ).
fof(f38529,plain,
( spl0_333
<=> subset(sk0_6,set_intersection2(sk0_7,sk0_8)) ),
introduced(split_symbol_definition) ).
fof(f38530,plain,
( subset(sk0_6,set_intersection2(sk0_7,sk0_8))
| ~ spl0_333 ),
inference(component_clause,[status(thm)],[f38529]) ).
fof(f38532,plain,
( subset(sk0_6,set_intersection2(sk0_7,sk0_8))
| subset(sk0_6,set_intersection2(sk0_7,sk0_8)) ),
inference(resolution,[status(thm)],[f38501,f67]) ).
fof(f38533,plain,
spl0_333,
inference(split_clause,[status(thm)],[f38532,f38529]) ).
fof(f38553,plain,
( $false
| ~ spl0_333 ),
inference(forward_subsumption_resolution,[status(thm)],[f38530,f107]) ).
fof(f38554,plain,
~ spl0_333,
inference(contradiction_clause,[status(thm)],[f38553]) ).
fof(f38555,plain,
$false,
inference(sat_refutation,[status(thm)],[f38533,f38554]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU128+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue May 30 09:15:42 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % Drodi V3.5.1
% 171.81/22.07 % Refutation found
% 171.81/22.07 % SZS status Theorem for theBenchmark: Theorem is valid
% 171.81/22.07 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 173.97/22.55 % Elapsed time: 22.182653 seconds
% 173.97/22.55 % CPU time: 173.719970 seconds
% 173.97/22.55 % Memory used: 714.103 MB
%------------------------------------------------------------------------------