TSTP Solution File: SET146+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET146+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 : n013.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:13 EDT 2022
% Result : Theorem 0.18s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET146+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n013.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 : 600
% 0.13/0.34 % DateTime : Sun Jul 10 00:42:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.18/0.35 % SZS status Theorem
% 0.18/0.35 % SZS output begin IncompleteProof
% 0.18/0.35 cnf(c0, axiom,
% 0.18/0.35 empty_set != intersection(sK4,empty_set)).
% 0.18/0.35 cnf(c1, plain,
% 0.18/0.35 empty_set != intersection(sK4,empty_set),
% 0.18/0.35 inference(start, [], [c0])).
% 0.18/0.35
% 0.18/0.35 cnf(c2, axiom,
% 0.18/0.35 X0 = X1 | ~sP0(X1,X0)).
% 0.18/0.35 cnf(a0, assumption,
% 0.18/0.35 intersection(sK4,empty_set) = X0).
% 0.18/0.35 cnf(c3, plain,
% 0.18/0.35 $false,
% 0.18/0.35 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.18/0.35 cnf(c4, plain,
% 0.18/0.35 ~sP0(X1,X0),
% 0.18/0.35 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.18/0.35 cnf(c5, plain,
% 0.18/0.35 X1 != X2 | empty_set != X2,
% 0.18/0.35 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.18/0.35
% 0.18/0.35 cnf(a1, assumption,
% 0.18/0.35 X1 = X2).
% 0.18/0.35 cnf(c6, plain,
% 0.18/0.35 empty_set != X2,
% 0.18/0.35 inference(reflexivity, [assumptions([a1])], [c5])).
% 0.18/0.35
% 0.18/0.35 cnf(a2, assumption,
% 0.18/0.35 empty_set = X2).
% 0.18/0.35 cnf(c7, plain,
% 0.18/0.35 $false,
% 0.18/0.35 inference(reflexivity, [assumptions([a2])], [c6])).
% 0.18/0.35
% 0.18/0.35 cnf(c8, axiom,
% 0.18/0.35 sP0(X3,X4) | member(sK3(X3,X4),X3) | member(sK3(X3,X4),X4)).
% 0.18/0.35 cnf(a3, assumption,
% 0.18/0.35 X1 = X3).
% 0.18/0.35 cnf(a4, assumption,
% 0.18/0.35 X0 = X4).
% 0.18/0.35 cnf(c9, plain,
% 0.18/0.35 $false,
% 0.18/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 0.18/0.35 cnf(c10, plain,
% 0.18/0.35 member(sK3(X3,X4),X3) | member(sK3(X3,X4),X4),
% 0.18/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 0.18/0.35
% 0.18/0.35 cnf(c11, axiom,
% 0.18/0.35 ~member(X5,empty_set)).
% 0.18/0.35 cnf(a5, assumption,
% 0.18/0.35 sK3(X3,X4) = X5).
% 0.18/0.35 cnf(a6, assumption,
% 0.18/0.35 X3 = empty_set).
% 0.18/0.35 cnf(c12, plain,
% 0.18/0.35 member(sK3(X3,X4),X4),
% 0.18/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 0.18/0.35 cnf(c13, plain,
% 0.18/0.35 $false,
% 0.18/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 0.18/0.35
% 0.18/0.35 cnf(c14, axiom,
% 0.18/0.35 member(X6,X7) | ~member(X6,intersection(X8,X7))).
% 0.18/0.35 cnf(a7, assumption,
% 0.18/0.35 sK3(X3,X4) = X6).
% 0.18/0.35 cnf(a8, assumption,
% 0.18/0.35 X4 = intersection(X8,X7)).
% 0.18/0.35 cnf(c15, plain,
% 0.18/0.35 $false,
% 0.18/0.35 inference(strict_predicate_extension, [assumptions([a7, a8])], [c12, c14])).
% 0.18/0.35 cnf(c16, plain,
% 0.18/0.35 member(X6,X7),
% 0.18/0.35 inference(strict_predicate_extension, [assumptions([a7, a8])], [c12, c14])).
% 0.18/0.35
% 0.18/0.35 cnf(c17, plain,
% 0.18/0.35 ~member(sK3(X3,X4),X3)).
% 0.18/0.35 cnf(a9, assumption,
% 0.18/0.35 X6 = sK3(X3,X4)).
% 0.18/0.35 cnf(a10, assumption,
% 0.18/0.35 X7 = X3).
% 0.18/0.35 cnf(c18, plain,
% 0.18/0.35 $false,
% 0.18/0.35 inference(predicate_reduction, [assumptions([a9, a10])], [c16, c17])).
% 0.18/0.35
% 0.18/0.35 cnf(c19, plain,
% 0.18/0.35 $false,
% 0.18/0.35 inference(constraint_solving, [
% 0.18/0.35 bind(X0, intersection(sK4,empty_set)),
% 0.18/0.35 bind(X1, empty_set),
% 0.18/0.35 bind(X2, empty_set),
% 0.18/0.35 bind(X3, empty_set),
% 0.18/0.35 bind(X4, intersection(sK4,empty_set)),
% 0.18/0.35 bind(X5, sK3(X3,X4)),
% 0.18/0.35 bind(X6, sK3(X3,X4)),
% 0.18/0.35 bind(X7, empty_set),
% 0.18/0.35 bind(X8, sK4)
% 0.18/0.35 ],
% 0.18/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 0.18/0.35
% 0.18/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------