TSTP Solution File: SET175+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET175+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:44:28 EDT 2022
% Result : Theorem 3.45s 0.83s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET175+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/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.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 11:00:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 3.45/0.83 % SZS status Theorem
% 3.45/0.83 % SZS output begin IncompleteProof
% 3.45/0.83 cnf(c0, axiom,
% 3.45/0.83 sK3 != union(sK3,intersection(sK3,sK4))).
% 3.45/0.83 cnf(c1, plain,
% 3.45/0.83 sK3 != union(sK3,intersection(sK3,sK4)),
% 3.45/0.83 inference(start, [], [c0])).
% 3.45/0.83
% 3.45/0.83 cnf(c2, axiom,
% 3.45/0.83 X0 = X1 | ~sP0(X1,X0)).
% 3.45/0.83 cnf(a0, assumption,
% 3.45/0.83 union(sK3,intersection(sK3,sK4)) = X1).
% 3.45/0.83 cnf(c3, plain,
% 3.45/0.83 $false,
% 3.45/0.83 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 3.45/0.83 cnf(c4, plain,
% 3.45/0.83 ~sP0(X1,X0),
% 3.45/0.83 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 3.45/0.83 cnf(c5, plain,
% 3.45/0.83 X0 != X2 | sK3 != X2,
% 3.45/0.83 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 3.45/0.83
% 3.45/0.83 cnf(a1, assumption,
% 3.45/0.83 X0 = X2).
% 3.45/0.83 cnf(c6, plain,
% 3.45/0.83 sK3 != X2,
% 3.45/0.83 inference(reflexivity, [assumptions([a1])], [c5])).
% 3.45/0.83
% 3.45/0.83 cnf(a2, assumption,
% 3.45/0.83 sK3 = X2).
% 3.45/0.83 cnf(c7, plain,
% 3.45/0.83 $false,
% 3.45/0.83 inference(reflexivity, [assumptions([a2])], [c6])).
% 3.45/0.83
% 3.45/0.83 cnf(c8, axiom,
% 3.45/0.83 sP0(X3,X4) | ~member(sK2(X3,X4),X3) | ~member(sK2(X3,X4),X4)).
% 3.45/0.83 cnf(a3, assumption,
% 3.45/0.83 X1 = X3).
% 3.45/0.83 cnf(a4, assumption,
% 3.45/0.83 X0 = X4).
% 3.45/0.83 cnf(c9, plain,
% 3.45/0.83 $false,
% 3.45/0.83 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 3.45/0.83 cnf(c10, plain,
% 3.45/0.83 ~member(sK2(X3,X4),X3) | ~member(sK2(X3,X4),X4),
% 3.45/0.83 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 3.45/0.83
% 3.45/0.83 cnf(c11, axiom,
% 3.45/0.83 member(X5,union(X6,X7)) | ~member(X5,X6)).
% 3.45/0.83 cnf(a5, assumption,
% 3.45/0.83 sK2(X3,X4) = X5).
% 3.45/0.83 cnf(a6, assumption,
% 3.45/0.83 X3 = union(X6,X7)).
% 3.45/0.83 cnf(c12, plain,
% 3.45/0.83 ~member(sK2(X3,X4),X4),
% 3.45/0.83 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 3.45/0.83 cnf(c13, plain,
% 3.45/0.83 ~member(X5,X6),
% 3.45/0.83 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 3.45/0.83
% 3.45/0.83 cnf(c14, axiom,
% 3.45/0.83 sP0(X8,X9) | member(sK2(X8,X9),X8) | member(sK2(X8,X9),X9)).
% 3.45/0.83 cnf(a7, assumption,
% 3.45/0.83 X5 = sK2(X8,X9)).
% 3.45/0.83 cnf(a8, assumption,
% 3.45/0.83 X6 = X9).
% 3.45/0.83 cnf(c15, plain,
% 3.45/0.83 $false,
% 3.45/0.83 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])).
% 3.45/0.83 cnf(c16, plain,
% 3.45/0.83 sP0(X8,X9) | member(sK2(X8,X9),X8),
% 3.45/0.83 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])).
% 3.45/0.83
% 3.45/0.83 cnf(c17, plain,
% 3.45/0.83 ~sP0(X1,X0)).
% 3.45/0.83 cnf(a9, assumption,
% 3.45/0.83 X8 = X1).
% 3.45/0.83 cnf(a10, assumption,
% 3.45/0.83 X9 = X0).
% 3.45/0.83 cnf(c18, plain,
% 3.45/0.83 member(sK2(X8,X9),X8),
% 3.45/0.83 inference(predicate_reduction, [assumptions([a9, a10])], [c16, c17])).
% 3.45/0.83
% 3.45/0.83 cnf(c19, plain,
% 3.45/0.83 ~member(sK2(X3,X4),X3)).
% 3.45/0.83 cnf(a11, assumption,
% 3.45/0.83 sK2(X8,X9) = sK2(X3,X4)).
% 3.45/0.83 cnf(a12, assumption,
% 3.45/0.83 X8 = X3).
% 3.45/0.83 cnf(c20, plain,
% 3.45/0.83 $false,
% 3.45/0.83 inference(predicate_reduction, [assumptions([a11, a12])], [c18, c19])).
% 3.45/0.83
% 3.45/0.83 cnf(c21, axiom,
% 3.45/0.83 member(X10,X11) | member(X10,X12) | ~member(X10,union(X12,X11))).
% 3.45/0.83 cnf(a13, assumption,
% 3.45/0.83 sK2(X3,X4) = X10).
% 3.45/0.83 cnf(a14, assumption,
% 3.45/0.83 X4 = X12).
% 3.45/0.83 cnf(c22, plain,
% 3.45/0.83 $false,
% 3.45/0.83 inference(strict_predicate_extension, [assumptions([a13, a14])], [c12, c21])).
% 3.45/0.83 cnf(c23, plain,
% 3.45/0.83 member(X10,X11) | ~member(X10,union(X12,X11)),
% 3.45/0.83 inference(strict_predicate_extension, [assumptions([a13, a14])], [c12, c21])).
% 3.45/0.83
% 3.45/0.83 cnf(c24, axiom,
% 3.45/0.83 member(X13,X14) | ~member(X13,intersection(X14,X15))).
% 3.45/0.83 cnf(a15, assumption,
% 3.45/0.83 X10 = X13).
% 3.45/0.83 cnf(a16, assumption,
% 3.45/0.83 X11 = intersection(X14,X15)).
% 3.45/0.83 cnf(c25, plain,
% 3.45/0.83 ~member(X10,union(X12,X11)),
% 3.45/0.83 inference(strict_predicate_extension, [assumptions([a15, a16])], [c23, c24])).
% 3.45/0.83 cnf(c26, plain,
% 3.45/0.83 member(X13,X14),
% 3.45/0.83 inference(strict_predicate_extension, [assumptions([a15, a16])], [c23, c24])).
% 3.45/0.83
% 3.45/0.83 cnf(c27, plain,
% 3.45/0.83 ~member(sK2(X3,X4),X4)).
% 3.45/0.83 cnf(a17, assumption,
% 3.45/0.83 X13 = sK2(X3,X4)).
% 3.45/0.83 cnf(a18, assumption,
% 3.45/0.83 X14 = X4).
% 3.45/0.83 cnf(c28, plain,
% 3.45/0.83 $false,
% 3.45/0.83 inference(predicate_reduction, [assumptions([a17, a18])], [c26, c27])).
% 3.45/0.83
% 3.45/0.83 cnf(c29, plain,
% 3.45/0.83 member(sK2(X3,X4),X3)).
% 3.45/0.83 cnf(a19, assumption,
% 3.45/0.83 X10 = sK2(X3,X4)).
% 3.45/0.83 cnf(a20, assumption,
% 3.45/0.83 union(X12,X11) = X3).
% 3.45/0.83 cnf(c30, plain,
% 3.45/0.83 $false,
% 3.45/0.83 inference(predicate_reduction, [assumptions([a19, a20])], [c25, c29])).
% 3.45/0.83
% 3.45/0.83 cnf(c31, plain,
% 3.45/0.83 $false,
% 3.45/0.83 inference(constraint_solving, [
% 3.45/0.83 bind(X0, sK3),
% 3.45/0.83 bind(X1, union(sK3,intersection(sK3,sK4))),
% 3.45/0.83 bind(X2, sK3),
% 3.45/0.83 bind(X3, union(sK3,intersection(sK3,sK4))),
% 3.45/0.83 bind(X4, sK3),
% 3.45/0.83 bind(X5, sK2(X3,X4)),
% 3.45/0.83 bind(X6, sK3),
% 3.45/0.83 bind(X7, intersection(sK3,sK4)),
% 3.45/0.83 bind(X8, union(sK3,intersection(sK3,sK4))),
% 3.45/0.83 bind(X9, sK3),
% 3.45/0.83 bind(X10, sK2(X3,X4)),
% 3.45/0.83 bind(X11, intersection(X14,X15)),
% 3.45/0.83 bind(X12, sK3),
% 3.45/0.83 bind(X13, sK2(X3,X4)),
% 3.45/0.83 bind(X14, sK3),
% 3.45/0.83 bind(X15, sK4)
% 3.45/0.83 ],
% 3.45/0.83 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])).
% 3.45/0.83
% 3.45/0.83 % SZS output end IncompleteProof
%------------------------------------------------------------------------------