TSTP Solution File: SET630+3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SET630+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n027.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:34:52 EDT 2023
% Result : Theorem 0.14s 0.32s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 17 unt; 0 def)
% Number of atoms : 68 ( 4 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 60 ( 27 ~; 23 |; 6 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 52 (; 50 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [B,C] : symmetric_difference(B,C) = union(difference(B,C),difference(C,B)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [B,C,D] :
( intersect(B,union(C,D))
<=> ( intersect(B,C)
| intersect(B,D) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [B,C] : disjoint(intersection(B,C),difference(B,C)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [B,C] :
( disjoint(B,C)
<=> ~ intersect(B,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [B,C] : intersection(B,C) = intersection(C,B),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,conjecture,
! [B,C] : disjoint(intersection(B,C),symmetric_difference(B,C)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f13,negated_conjecture,
~ ! [B,C] : disjoint(intersection(B,C),symmetric_difference(B,C)),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f15,plain,
! [B,C,D] :
( ( ~ intersect(B,union(C,D))
| intersect(B,C)
| intersect(B,D) )
& ( intersect(B,union(C,D))
| ( ~ intersect(B,C)
& ~ intersect(B,D) ) ) ),
inference(NNF_transformation,[status(esa)],[f2]) ).
fof(f16,plain,
( ! [B,C,D] :
( ~ intersect(B,union(C,D))
| intersect(B,C)
| intersect(B,D) )
& ! [B,C,D] :
( intersect(B,union(C,D))
| ( ~ intersect(B,C)
& ~ intersect(B,D) ) ) ),
inference(miniscoping,[status(esa)],[f15]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ~ intersect(X0,union(X1,X2))
| intersect(X0,X1)
| intersect(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f20,plain,
! [X0,X1] : disjoint(intersection(X0,X1),difference(X0,X1)),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f32,plain,
! [B,C] :
( ( ~ disjoint(B,C)
| ~ intersect(B,C) )
& ( disjoint(B,C)
| intersect(B,C) ) ),
inference(NNF_transformation,[status(esa)],[f6]) ).
fof(f33,plain,
( ! [B,C] :
( ~ disjoint(B,C)
| ~ intersect(B,C) )
& ! [B,C] :
( disjoint(B,C)
| intersect(B,C) ) ),
inference(miniscoping,[status(esa)],[f32]) ).
fof(f34,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f33]) ).
fof(f35,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f33]) ).
fof(f37,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f48,plain,
? [B,C] : ~ disjoint(intersection(B,C),symmetric_difference(B,C)),
inference(pre_NNF_transformation,[status(esa)],[f13]) ).
fof(f49,plain,
~ disjoint(intersection(sk0_2,sk0_3),symmetric_difference(sk0_2,sk0_3)),
inference(skolemization,[status(esa)],[f48]) ).
fof(f50,plain,
~ disjoint(intersection(sk0_2,sk0_3),symmetric_difference(sk0_2,sk0_3)),
inference(cnf_transformation,[status(esa)],[f49]) ).
fof(f51,plain,
intersect(intersection(sk0_2,sk0_3),symmetric_difference(sk0_2,sk0_3)),
inference(resolution,[status(thm)],[f35,f50]) ).
fof(f56,plain,
! [X0,X1] : ~ intersect(intersection(X0,X1),difference(X0,X1)),
inference(resolution,[status(thm)],[f20,f34]) ).
fof(f60,plain,
! [X0,X1] : ~ intersect(intersection(X0,X1),difference(X1,X0)),
inference(paramodulation,[status(thm)],[f37,f56]) ).
fof(f98,plain,
! [X0,X1,X2] :
( ~ intersect(X0,symmetric_difference(X1,X2))
| intersect(X0,difference(X1,X2))
| intersect(X0,difference(X2,X1)) ),
inference(paramodulation,[status(thm)],[f14,f17]) ).
fof(f515,plain,
( spl0_22
<=> intersect(intersection(sk0_2,sk0_3),difference(sk0_2,sk0_3)) ),
introduced(split_symbol_definition) ).
fof(f516,plain,
( intersect(intersection(sk0_2,sk0_3),difference(sk0_2,sk0_3))
| ~ spl0_22 ),
inference(component_clause,[status(thm)],[f515]) ).
fof(f518,plain,
( spl0_23
<=> intersect(intersection(sk0_2,sk0_3),difference(sk0_3,sk0_2)) ),
introduced(split_symbol_definition) ).
fof(f519,plain,
( intersect(intersection(sk0_2,sk0_3),difference(sk0_3,sk0_2))
| ~ spl0_23 ),
inference(component_clause,[status(thm)],[f518]) ).
fof(f521,plain,
( intersect(intersection(sk0_2,sk0_3),difference(sk0_2,sk0_3))
| intersect(intersection(sk0_2,sk0_3),difference(sk0_3,sk0_2)) ),
inference(resolution,[status(thm)],[f98,f51]) ).
fof(f522,plain,
( spl0_22
| spl0_23 ),
inference(split_clause,[status(thm)],[f521,f515,f518]) ).
fof(f526,plain,
( $false
| ~ spl0_22 ),
inference(forward_subsumption_resolution,[status(thm)],[f516,f56]) ).
fof(f527,plain,
~ spl0_22,
inference(contradiction_clause,[status(thm)],[f526]) ).
fof(f528,plain,
( $false
| ~ spl0_23 ),
inference(forward_subsumption_resolution,[status(thm)],[f519,f60]) ).
fof(f529,plain,
~ spl0_23,
inference(contradiction_clause,[status(thm)],[f528]) ).
fof(f530,plain,
$false,
inference(sat_refutation,[status(thm)],[f522,f527,f529]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : SET630+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n027.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue May 30 10:37:02 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.09/0.30 % Drodi V3.5.1
% 0.14/0.32 % Refutation found
% 0.14/0.32 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.32 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.36 % Elapsed time: 0.045399 seconds
% 0.14/0.36 % CPU time: 0.030716 seconds
% 0.14/0.36 % Memory used: 4.003 MB
%------------------------------------------------------------------------------