TSTP Solution File: SET596+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET596+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n005.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 : 600s
% DateTime : Tue Jul 19 02:46:51 EDT 2022
% Result : Theorem 0.12s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET596+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 19:17:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 % SZS status Theorem
% 0.12/0.35 % SZS output begin IncompleteProof
% 0.12/0.35 cnf(c0, axiom,
% 0.12/0.35 empty_set = intersection(sK5,sK6)).
% 0.12/0.35 cnf(c1, plain,
% 0.12/0.35 empty_set = intersection(sK5,sK6),
% 0.12/0.35 inference(start, [], [c0])).
% 0.12/0.35
% 0.12/0.35 cnf(c2, axiom,
% 0.12/0.35 subset(intersection(X0,X1),intersection(X2,X1)) | ~subset(X0,X2)).
% 0.12/0.35 cnf(a0, assumption,
% 0.12/0.35 intersection(X2,X1) = intersection(sK5,sK6)).
% 0.12/0.35 cnf(a1, assumption,
% 0.12/0.35 empty_set = X3).
% 0.12/0.35 cnf(c3, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.35 cnf(c4, plain,
% 0.12/0.35 ~subset(X0,X2),
% 0.12/0.35 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.35 cnf(c5, plain,
% 0.12/0.35 subset(intersection(X0,X1),X3),
% 0.12/0.35 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.35
% 0.12/0.35 cnf(c6, axiom,
% 0.12/0.35 empty_set = X4 | ~subset(X4,empty_set)).
% 0.12/0.35 cnf(a2, assumption,
% 0.12/0.35 intersection(X0,X1) = X4).
% 0.12/0.35 cnf(a3, assumption,
% 0.12/0.35 X3 = empty_set).
% 0.12/0.35 cnf(c7, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 0.12/0.35 cnf(c8, plain,
% 0.12/0.35 empty_set = X4,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 0.12/0.35
% 0.12/0.35 cnf(c9, axiom,
% 0.12/0.35 empty_set != intersection(sK4,sK6)).
% 0.12/0.35 cnf(a4, assumption,
% 0.12/0.35 intersection(sK4,sK6) = X4).
% 0.12/0.35 cnf(a5, assumption,
% 0.12/0.35 empty_set = X5).
% 0.12/0.35 cnf(c10, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_subterm_extension, [assumptions([a4, a5])], [c8, c9])).
% 0.12/0.35 cnf(c11, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_subterm_extension, [assumptions([a4, a5])], [c8, c9])).
% 0.12/0.35 cnf(c12, plain,
% 0.12/0.35 empty_set != X5,
% 0.12/0.35 inference(strict_subterm_extension, [assumptions([a4, a5])], [c8, c9])).
% 0.12/0.35
% 0.12/0.35 cnf(a6, assumption,
% 0.12/0.35 empty_set = X5).
% 0.12/0.35 cnf(c13, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(reflexivity, [assumptions([a6])], [c12])).
% 0.12/0.35
% 0.12/0.35 cnf(c14, axiom,
% 0.12/0.35 subset(sK4,sK5)).
% 0.12/0.35 cnf(a7, assumption,
% 0.12/0.35 X0 = sK4).
% 0.12/0.35 cnf(a8, assumption,
% 0.12/0.35 X2 = sK5).
% 0.12/0.35 cnf(c15, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a7, a8])], [c4, c14])).
% 0.12/0.35 cnf(c16, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a7, a8])], [c4, c14])).
% 0.12/0.35
% 0.12/0.35 cnf(c17, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(constraint_solving, [
% 0.12/0.35 bind(X0, sK4),
% 0.12/0.35 bind(X1, sK6),
% 0.12/0.35 bind(X2, sK5),
% 0.12/0.35 bind(X3, empty_set),
% 0.12/0.35 bind(X4, intersection(X0,X1)),
% 0.12/0.35 bind(X5, empty_set)
% 0.12/0.35 ],
% 0.12/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.12/0.35
% 0.12/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------