TSTP Solution File: SET622+3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SET622+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n026.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:50 EDT 2023
% Result : Theorem 0.14s 0.32s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 10 ( 10 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 42 (; 39 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [B,C,D] : intersection(intersection(B,C),D) = intersection(B,intersection(C,D)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [B,C,D] : difference(B,difference(C,D)) = union(difference(B,C),intersection(B,D)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [B,C] : symmetric_difference(B,C) = difference(union(B,C),intersection(B,C)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [B,C] : union(B,C) = union(C,B),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [B,C] : intersection(B,C) = intersection(C,B),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,conjecture,
! [B,C,D] : difference(B,symmetric_difference(C,D)) = union(difference(B,union(C,D)),intersection(intersection(B,C),D)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,negated_conjecture,
~ ! [B,C,D] : difference(B,symmetric_difference(C,D)) = union(difference(B,union(C,D)),intersection(intersection(B,C),D)),
inference(negated_conjecture,[status(cth)],[f15]) ).
fof(f17,plain,
! [X0,X1,X2] : intersection(intersection(X0,X1),X2) = intersection(X0,intersection(X1,X2)),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f18,plain,
! [X0,X1,X2] : difference(X0,difference(X1,X2)) = union(difference(X0,X1),intersection(X0,X2)),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f19,plain,
! [X0,X1] : symmetric_difference(X0,X1) = difference(union(X0,X1),intersection(X0,X1)),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f41,plain,
! [X0,X1] : union(X0,X1) = union(X1,X0),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f42,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f59,plain,
? [B,C,D] : difference(B,symmetric_difference(C,D)) != union(difference(B,union(C,D)),intersection(intersection(B,C),D)),
inference(pre_NNF_transformation,[status(esa)],[f16]) ).
fof(f60,plain,
difference(sk0_2,symmetric_difference(sk0_3,sk0_4)) != union(difference(sk0_2,union(sk0_3,sk0_4)),intersection(intersection(sk0_2,sk0_3),sk0_4)),
inference(skolemization,[status(esa)],[f59]) ).
fof(f61,plain,
difference(sk0_2,symmetric_difference(sk0_3,sk0_4)) != union(difference(sk0_2,union(sk0_3,sk0_4)),intersection(intersection(sk0_2,sk0_3),sk0_4)),
inference(cnf_transformation,[status(esa)],[f60]) ).
fof(f64,plain,
difference(sk0_2,symmetric_difference(sk0_3,sk0_4)) != union(intersection(intersection(sk0_2,sk0_3),sk0_4),difference(sk0_2,union(sk0_3,sk0_4))),
inference(paramodulation,[status(thm)],[f41,f61]) ).
fof(f66,plain,
difference(sk0_2,symmetric_difference(sk0_3,sk0_4)) != union(intersection(sk0_4,intersection(sk0_2,sk0_3)),difference(sk0_2,union(sk0_3,sk0_4))),
inference(paramodulation,[status(thm)],[f42,f64]) ).
fof(f84,plain,
! [X0,X1,X2] : intersection(intersection(X0,X1),X2) = intersection(X1,intersection(X0,X2)),
inference(paramodulation,[status(thm)],[f42,f17]) ).
fof(f85,plain,
! [X0,X1,X2] : intersection(X0,intersection(X1,X2)) = intersection(X1,intersection(X0,X2)),
inference(forward_demodulation,[status(thm)],[f17,f84]) ).
fof(f92,plain,
! [X0,X1,X2] : difference(X0,difference(X1,X2)) = union(intersection(X0,X2),difference(X0,X1)),
inference(paramodulation,[status(thm)],[f41,f18]) ).
fof(f283,plain,
difference(sk0_2,symmetric_difference(sk0_3,sk0_4)) != union(intersection(sk0_2,intersection(sk0_4,sk0_3)),difference(sk0_2,union(sk0_3,sk0_4))),
inference(forward_demodulation,[status(thm)],[f85,f66]) ).
fof(f284,plain,
difference(sk0_2,symmetric_difference(sk0_3,sk0_4)) != union(intersection(sk0_2,intersection(sk0_3,sk0_4)),difference(sk0_2,union(sk0_3,sk0_4))),
inference(forward_demodulation,[status(thm)],[f42,f283]) ).
fof(f347,plain,
difference(sk0_2,symmetric_difference(sk0_3,sk0_4)) != difference(sk0_2,difference(union(sk0_3,sk0_4),intersection(sk0_3,sk0_4))),
inference(backward_demodulation,[status(thm)],[f92,f284]) ).
fof(f348,plain,
difference(sk0_2,symmetric_difference(sk0_3,sk0_4)) != difference(sk0_2,symmetric_difference(sk0_3,sk0_4)),
inference(forward_demodulation,[status(thm)],[f19,f347]) ).
fof(f349,plain,
$false,
inference(trivial_equality_resolution,[status(esa)],[f348]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SET622+3 : TPTP v8.1.2. Released v2.2.0.
% 0.02/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n026.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:29:58 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.09/0.31 % 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.55 % Elapsed time: 0.030175 seconds
% 0.14/0.55 % CPU time: 0.023065 seconds
% 0.14/0.55 % Memory used: 3.908 MB
%------------------------------------------------------------------------------