TSTP Solution File: SEU010+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU010+1 : TPTP v8.1.0. Released v3.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 : n007.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:52:47 EDT 2022
% Result : Theorem 9.17s 1.54s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SEU010+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.37 % Computer : n007.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Sun Jun 19 23:59:44 EDT 2022
% 0.15/0.37 % CPUTime :
% 9.17/1.54 % SZS status Theorem
% 9.17/1.54 % SZS output begin IncompleteProof
% 9.17/1.54 cnf(c0, axiom,
% 9.17/1.54 relation(sK9)).
% 9.17/1.54 cnf(c1, plain,
% 9.17/1.54 relation(sK9),
% 9.17/1.54 inference(start, [], [c0])).
% 9.17/1.54
% 9.17/1.54 cnf(c2, axiom,
% 9.17/1.54 relation_composition(identity_relation(X0),X1) = X1 | ~subset(relation_dom(X1),X0) | ~relation(X1)).
% 9.17/1.54 cnf(a0, assumption,
% 9.17/1.54 sK9 = X1).
% 9.17/1.54 cnf(c3, plain,
% 9.17/1.54 $false,
% 9.17/1.54 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 9.17/1.54 cnf(c4, plain,
% 9.17/1.54 relation_composition(identity_relation(X0),X1) = X1 | ~subset(relation_dom(X1),X0),
% 9.17/1.54 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 9.17/1.54
% 9.17/1.54 cnf(c5, axiom,
% 9.17/1.54 sK9 != relation_composition(sK9,identity_relation(relation_rng(sK9))) | sK9 != relation_composition(identity_relation(relation_dom(sK9)),sK9)).
% 9.17/1.54 cnf(a1, assumption,
% 9.17/1.54 relation_composition(identity_relation(relation_dom(sK9)),sK9) = relation_composition(identity_relation(X0),X1)).
% 9.17/1.54 cnf(c6, plain,
% 9.17/1.54 ~subset(relation_dom(X1),X0),
% 9.17/1.54 inference(strict_subterm_extension, [assumptions([a1])], [c4, c5])).
% 9.17/1.54 cnf(c7, plain,
% 9.17/1.54 sK9 != relation_composition(sK9,identity_relation(relation_rng(sK9))),
% 9.17/1.54 inference(strict_subterm_extension, [assumptions([a1])], [c4, c5])).
% 9.17/1.54 cnf(c8, plain,
% 9.17/1.54 sK9 != X1,
% 9.17/1.54 inference(strict_subterm_extension, [assumptions([a1])], [c4, c5])).
% 9.17/1.54
% 9.17/1.54 cnf(a2, assumption,
% 9.17/1.54 sK9 = X1).
% 9.17/1.54 cnf(c9, plain,
% 9.17/1.54 $false,
% 9.17/1.54 inference(reflexivity, [assumptions([a2])], [c8])).
% 9.17/1.54
% 9.17/1.54 cnf(c10, axiom,
% 9.17/1.54 relation_composition(X2,identity_relation(X3)) = X2 | ~subset(relation_rng(X2),X3) | ~relation(X2)).
% 9.17/1.54 cnf(a3, assumption,
% 9.17/1.54 relation_composition(sK9,identity_relation(relation_rng(sK9))) = relation_composition(X2,identity_relation(X3))).
% 9.17/1.54 cnf(c11, plain,
% 9.17/1.54 $false,
% 9.17/1.54 inference(strict_function_extension, [assumptions([a3])], [c7, c10])).
% 9.17/1.54 cnf(c12, plain,
% 9.17/1.54 ~subset(relation_rng(X2),X3) | ~relation(X2),
% 9.17/1.54 inference(strict_function_extension, [assumptions([a3])], [c7, c10])).
% 9.17/1.54 cnf(c13, plain,
% 9.17/1.54 X4 != X2 | sK9 != X4,
% 9.17/1.54 inference(strict_function_extension, [assumptions([a3])], [c7, c10])).
% 9.17/1.54
% 9.17/1.54 cnf(a4, assumption,
% 9.17/1.54 X4 = X2).
% 9.17/1.54 cnf(c14, plain,
% 9.17/1.54 sK9 != X4,
% 9.17/1.54 inference(reflexivity, [assumptions([a4])], [c13])).
% 9.17/1.54
% 9.17/1.54 cnf(a5, assumption,
% 9.17/1.54 sK9 = X4).
% 9.17/1.54 cnf(c15, plain,
% 9.17/1.54 $false,
% 9.17/1.54 inference(reflexivity, [assumptions([a5])], [c14])).
% 9.17/1.54
% 9.17/1.54 cnf(c16, axiom,
% 9.17/1.54 subset(X5,X5)).
% 9.17/1.54 cnf(a6, assumption,
% 9.17/1.54 relation_rng(X2) = X5).
% 9.17/1.54 cnf(a7, assumption,
% 9.17/1.54 X3 = X5).
% 9.17/1.54 cnf(c17, plain,
% 9.17/1.54 ~relation(X2),
% 9.17/1.54 inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c16])).
% 9.17/1.54 cnf(c18, plain,
% 9.17/1.54 $false,
% 9.17/1.54 inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c16])).
% 9.17/1.54
% 9.17/1.54 cnf(c19, plain,
% 9.17/1.54 relation(sK9)).
% 9.17/1.54 cnf(a8, assumption,
% 9.17/1.54 X2 = sK9).
% 9.17/1.54 cnf(c20, plain,
% 9.17/1.54 $false,
% 9.17/1.54 inference(predicate_reduction, [assumptions([a8])], [c17, c19])).
% 9.17/1.54
% 9.17/1.54 cnf(c21, axiom,
% 9.17/1.54 subset(X6,X6)).
% 9.17/1.54 cnf(a9, assumption,
% 9.17/1.54 relation_dom(X1) = X6).
% 9.17/1.54 cnf(a10, assumption,
% 9.17/1.54 X0 = X6).
% 9.17/1.54 cnf(c22, plain,
% 9.17/1.54 $false,
% 9.17/1.54 inference(strict_predicate_extension, [assumptions([a9, a10])], [c6, c21])).
% 9.17/1.54 cnf(c23, plain,
% 9.17/1.54 $false,
% 9.17/1.54 inference(strict_predicate_extension, [assumptions([a9, a10])], [c6, c21])).
% 9.17/1.54
% 9.17/1.54 cnf(c24, plain,
% 9.17/1.54 $false,
% 9.17/1.54 inference(constraint_solving, [
% 9.17/1.54 bind(X0, relation_dom(sK9)),
% 9.17/1.54 bind(X1, sK9),
% 9.17/1.54 bind(X2, sK9),
% 9.17/1.54 bind(X3, relation_rng(sK9)),
% 9.17/1.54 bind(X4, sK9),
% 9.17/1.54 bind(X5, relation_rng(X2)),
% 9.17/1.54 bind(X6, relation_dom(X1))
% 9.17/1.54 ],
% 9.17/1.54 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 9.17/1.54
% 9.17/1.54 % SZS output end IncompleteProof
%------------------------------------------------------------------------------