TSTP Solution File: SET619+3 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SET619+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n010.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 : Tue Apr 30 20:39:59 EDT 2024
% Result : Theorem 2.18s 0.67s
% Output : CNFRefutation 2.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 32 unt; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 60 ( 58 !; 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] : union(union(B,C),D) = union(B,union(C,D)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [B,C] : union(B,intersection(B,C)) = B,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [B,C] : union(intersection(B,C),difference(B,C)) = B,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [B,C] : union(B,C) = union(C,B),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [B,C] : intersection(B,C) = intersection(C,B),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,conjecture,
! [B,C] : union(B,C) = union(symmetric_difference(B,C),intersection(B,C)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,negated_conjecture,
~ ! [B,C] : union(B,C) = union(symmetric_difference(B,C),intersection(B,C)),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f17,plain,
! [X0,X1,X2] : union(union(X0,X1),X2) = union(X0,union(X1,X2)),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f18,plain,
! [X0,X1] : union(X0,intersection(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f19,plain,
! [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) = X0,
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f35,plain,
! [X0,X1] : union(X0,X1) = union(X1,X0),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f36,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f53,plain,
? [B,C] : union(B,C) != union(symmetric_difference(B,C),intersection(B,C)),
inference(pre_NNF_transformation,[status(esa)],[f15]) ).
fof(f54,plain,
union(sk0_2,sk0_3) != union(symmetric_difference(sk0_2,sk0_3),intersection(sk0_2,sk0_3)),
inference(skolemization,[status(esa)],[f53]) ).
fof(f55,plain,
union(sk0_2,sk0_3) != union(symmetric_difference(sk0_2,sk0_3),intersection(sk0_2,sk0_3)),
inference(cnf_transformation,[status(esa)],[f54]) ).
fof(f58,plain,
! [X0,X1] : union(X0,intersection(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f36,f18]) ).
fof(f67,plain,
! [X0,X1,X2] : union(union(X0,X1),X2) = union(X1,union(X0,X2)),
inference(paramodulation,[status(thm)],[f35,f17]) ).
fof(f68,plain,
! [X0,X1,X2] : union(X0,union(X1,X2)) = union(X1,union(X0,X2)),
inference(forward_demodulation,[status(thm)],[f17,f67]) ).
fof(f227,plain,
! [X0,X1,X2] : union(X0,X1) = union(X1,union(X0,intersection(X2,X1))),
inference(paramodulation,[status(thm)],[f58,f68]) ).
fof(f296,plain,
! [X0,X1,X2] : union(symmetric_difference(X0,X1),X2) = union(difference(X0,X1),union(difference(X1,X0),X2)),
inference(paramodulation,[status(thm)],[f16,f17]) ).
fof(f301,plain,
! [X0,X1] : union(difference(X0,X1),intersection(X0,X1)) = X0,
inference(forward_demodulation,[status(thm)],[f35,f19]) ).
fof(f302,plain,
! [X0,X1] : union(difference(X0,X1),intersection(X1,X0)) = X0,
inference(paramodulation,[status(thm)],[f36,f301]) ).
fof(f996,plain,
! [X0,X1] : union(difference(X0,X1),X1) = union(X1,X0),
inference(paramodulation,[status(thm)],[f301,f227]) ).
fof(f997,plain,
! [X0,X1] : union(X0,difference(X1,X0)) = union(X0,X1),
inference(forward_demodulation,[status(thm)],[f35,f996]) ).
fof(f1287,plain,
! [X0,X1] : union(symmetric_difference(X0,X1),intersection(X0,X1)) = union(difference(X0,X1),X1),
inference(paramodulation,[status(thm)],[f302,f296]) ).
fof(f1288,plain,
! [X0,X1] : union(symmetric_difference(X0,X1),intersection(X0,X1)) = union(X1,difference(X0,X1)),
inference(forward_demodulation,[status(thm)],[f35,f1287]) ).
fof(f1289,plain,
! [X0,X1] : union(symmetric_difference(X0,X1),intersection(X0,X1)) = union(X1,X0),
inference(forward_demodulation,[status(thm)],[f997,f1288]) ).
fof(f1904,plain,
union(sk0_2,sk0_3) != union(sk0_3,sk0_2),
inference(backward_demodulation,[status(thm)],[f1289,f55]) ).
fof(f1905,plain,
union(sk0_2,sk0_3) != union(sk0_2,sk0_3),
inference(forward_demodulation,[status(thm)],[f35,f1904]) ).
fof(f1906,plain,
$false,
inference(trivial_equality_resolution,[status(esa)],[f1905]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET619+3 : TPTP v8.1.2. Released v2.2.0.
% 0.12/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Apr 29 21:30:35 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.6.0
% 2.18/0.67 % Refutation found
% 2.18/0.67 % SZS status Theorem for theBenchmark: Theorem is valid
% 2.18/0.67 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 2.18/0.68 % Elapsed time: 0.337327 seconds
% 2.18/0.68 % CPU time: 2.570970 seconds
% 2.18/0.68 % Total memory used: 91.352 MB
% 2.18/0.68 % Net memory used: 90.701 MB
%------------------------------------------------------------------------------