TSTP Solution File: SEU188+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU188+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n008.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 11:53:53 EDT 2022
% Result : Theorem 6.98s 1.31s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU188+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n008.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 Jun 19 02:20:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 6.98/1.31 % SZS status Theorem
% 6.98/1.31 % SZS output begin IncompleteProof
% 6.98/1.31 cnf(c0, axiom,
% 6.98/1.31 empty_set = relation_rng(sK17) | empty_set = relation_dom(sK17)).
% 6.98/1.31 cnf(c1, plain,
% 6.98/1.31 empty_set = relation_rng(sK17) | empty_set = relation_dom(sK17),
% 6.98/1.31 inference(start, [], [c0])).
% 6.98/1.31
% 6.98/1.31 cnf(c2, axiom,
% 6.98/1.31 ~empty(relation_rng(X0)) | ~relation(X0) | empty(X0)).
% 6.98/1.31 cnf(a0, assumption,
% 6.98/1.31 relation_rng(X0) = relation_rng(sK17)).
% 6.98/1.31 cnf(a1, assumption,
% 6.98/1.31 empty_set = X1).
% 6.98/1.31 cnf(c3, plain,
% 6.98/1.31 empty_set = relation_dom(sK17),
% 6.98/1.31 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 6.98/1.31 cnf(c4, plain,
% 6.98/1.31 ~relation(X0) | empty(X0),
% 6.98/1.31 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 6.98/1.31 cnf(c5, plain,
% 6.98/1.31 ~empty(X1),
% 6.98/1.31 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 6.98/1.31
% 6.98/1.31 cnf(c6, axiom,
% 6.98/1.31 empty(empty_set)).
% 6.98/1.31 cnf(a2, assumption,
% 6.98/1.31 X1 = empty_set).
% 6.98/1.31 cnf(c7, plain,
% 6.98/1.31 $false,
% 6.98/1.31 inference(strict_predicate_extension, [assumptions([a2])], [c5, c6])).
% 6.98/1.31 cnf(c8, plain,
% 6.98/1.31 $false,
% 6.98/1.31 inference(strict_predicate_extension, [assumptions([a2])], [c5, c6])).
% 6.98/1.31
% 6.98/1.31 cnf(c9, axiom,
% 6.98/1.31 relation(sK17)).
% 6.98/1.31 cnf(a3, assumption,
% 6.98/1.31 X0 = sK17).
% 6.98/1.31 cnf(c10, plain,
% 6.98/1.31 empty(X0),
% 6.98/1.31 inference(strict_predicate_extension, [assumptions([a3])], [c4, c9])).
% 6.98/1.31 cnf(c11, plain,
% 6.98/1.31 $false,
% 6.98/1.31 inference(strict_predicate_extension, [assumptions([a3])], [c4, c9])).
% 6.98/1.31
% 6.98/1.31 cnf(c12, axiom,
% 6.98/1.31 empty_set = X2 | ~empty(X2)).
% 6.98/1.31 cnf(a4, assumption,
% 6.98/1.31 X0 = X2).
% 6.98/1.31 cnf(c13, plain,
% 6.98/1.31 $false,
% 6.98/1.31 inference(strict_predicate_extension, [assumptions([a4])], [c10, c12])).
% 6.98/1.31 cnf(c14, plain,
% 6.98/1.31 empty_set = X2,
% 6.98/1.31 inference(strict_predicate_extension, [assumptions([a4])], [c10, c12])).
% 6.98/1.31
% 6.98/1.31 cnf(c15, axiom,
% 6.98/1.31 empty_set != sK17).
% 6.98/1.31 cnf(a5, assumption,
% 6.98/1.31 sK17 = X2).
% 6.98/1.31 cnf(a6, assumption,
% 6.98/1.31 empty_set = X3).
% 6.98/1.31 cnf(c16, plain,
% 6.98/1.31 $false,
% 6.98/1.31 inference(strict_subterm_extension, [assumptions([a5, a6])], [c14, c15])).
% 6.98/1.31 cnf(c17, plain,
% 6.98/1.31 $false,
% 6.98/1.31 inference(strict_subterm_extension, [assumptions([a5, a6])], [c14, c15])).
% 6.98/1.31 cnf(c18, plain,
% 6.98/1.31 empty_set != X3,
% 6.98/1.31 inference(strict_subterm_extension, [assumptions([a5, a6])], [c14, c15])).
% 6.98/1.31
% 6.98/1.31 cnf(a7, assumption,
% 6.98/1.31 empty_set = X3).
% 6.98/1.31 cnf(c19, plain,
% 6.98/1.31 $false,
% 6.98/1.31 inference(reflexivity, [assumptions([a7])], [c18])).
% 6.98/1.31
% 6.98/1.31 cnf(c20, axiom,
% 6.98/1.31 ~empty(relation_dom(X4)) | ~relation(X4) | empty(X4)).
% 6.98/1.31 cnf(a8, assumption,
% 6.98/1.31 relation_dom(X4) = relation_dom(sK17)).
% 6.98/1.31 cnf(a9, assumption,
% 6.98/1.31 empty_set = X5).
% 6.98/1.31 cnf(c21, plain,
% 6.98/1.31 $false,
% 6.98/1.31 inference(strict_subterm_extension, [assumptions([a8, a9])], [c3, c20])).
% 6.98/1.31 cnf(c22, plain,
% 6.98/1.31 ~relation(X4) | empty(X4),
% 6.98/1.31 inference(strict_subterm_extension, [assumptions([a8, a9])], [c3, c20])).
% 6.98/1.31 cnf(c23, plain,
% 6.98/1.31 ~empty(X5),
% 6.98/1.31 inference(strict_subterm_extension, [assumptions([a8, a9])], [c3, c20])).
% 6.98/1.31
% 6.98/1.31 cnf(c24, plain,
% 6.98/1.31 empty(X1)).
% 6.98/1.31 cnf(a10, assumption,
% 6.98/1.31 X5 = X1).
% 6.98/1.31 cnf(c25, plain,
% 6.98/1.31 $false,
% 6.98/1.31 inference(predicate_reduction, [assumptions([a10])], [c23, c24])).
% 6.98/1.31
% 6.98/1.31 cnf(c26, plain,
% 6.98/1.31 relation(X0)).
% 6.98/1.31 cnf(a11, assumption,
% 6.98/1.31 X4 = X0).
% 6.98/1.31 cnf(c27, plain,
% 6.98/1.31 empty(X4),
% 6.98/1.31 inference(predicate_reduction, [assumptions([a11])], [c22, c26])).
% 6.98/1.31
% 6.98/1.31 cnf(c28, plain,
% 6.98/1.31 ~empty(X0)).
% 6.98/1.31 cnf(a12, assumption,
% 6.98/1.31 X4 = X0).
% 6.98/1.31 cnf(c29, plain,
% 6.98/1.31 $false,
% 6.98/1.31 inference(predicate_reduction, [assumptions([a12])], [c27, c28])).
% 6.98/1.31
% 6.98/1.31 cnf(c30, plain,
% 6.98/1.31 $false,
% 6.98/1.31 inference(constraint_solving, [
% 6.98/1.31 bind(X0, sK17),
% 6.98/1.31 bind(X1, empty_set),
% 6.98/1.31 bind(X2, sK17),
% 6.98/1.31 bind(X3, empty_set),
% 6.98/1.31 bind(X4, sK17),
% 6.98/1.31 bind(X5, empty_set)
% 6.98/1.31 ],
% 6.98/1.31 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])).
% 6.98/1.31
% 6.98/1.31 % SZS output end IncompleteProof
%------------------------------------------------------------------------------