TSTP Solution File: SEU198+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU198+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 : n032.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:58 EDT 2022
% Result : Theorem 0.16s 0.31s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SEU198+1 : TPTP v8.1.0. Released v3.3.0.
% 0.09/0.10 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Sun Jun 19 21:21:48 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.16/0.31 % SZS status Theorem
% 0.16/0.31 % SZS output begin IncompleteProof
% 0.16/0.31 cnf(c0, axiom,
% 0.16/0.31 relation(sK11)).
% 0.16/0.31 cnf(c1, plain,
% 0.16/0.31 relation(sK11),
% 0.16/0.31 inference(start, [], [c0])).
% 0.16/0.31
% 0.16/0.31 cnf(c2, axiom,
% 0.16/0.31 sP1(X0,X1,X2) | ~relation(X2)).
% 0.16/0.31 cnf(a0, assumption,
% 0.16/0.31 sK11 = X2).
% 0.16/0.31 cnf(c3, plain,
% 0.16/0.31 $false,
% 0.16/0.31 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.16/0.31 cnf(c4, plain,
% 0.16/0.31 sP1(X0,X1,X2),
% 0.16/0.31 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.16/0.31
% 0.16/0.31 cnf(c5, axiom,
% 0.16/0.31 sP0(X3,X4,X5) | ~in(X4,relation_rng(relation_rng_restriction(X5,X3))) | ~sP1(X5,X4,X3)).
% 0.16/0.31 cnf(a1, assumption,
% 0.16/0.31 X0 = X5).
% 0.16/0.31 cnf(a2, assumption,
% 0.16/0.31 X1 = X4).
% 0.16/0.31 cnf(a3, assumption,
% 0.16/0.31 X2 = X3).
% 0.16/0.31 cnf(c6, plain,
% 0.16/0.31 $false,
% 0.16/0.31 inference(strict_predicate_extension, [assumptions([a1, a2, a3])], [c4, c5])).
% 0.16/0.31 cnf(c7, plain,
% 0.16/0.31 sP0(X3,X4,X5) | ~in(X4,relation_rng(relation_rng_restriction(X5,X3))),
% 0.16/0.31 inference(strict_predicate_extension, [assumptions([a1, a2, a3])], [c4, c5])).
% 0.16/0.31
% 0.16/0.31 cnf(c8, axiom,
% 0.16/0.31 in(X6,X7) | ~sP0(X8,X6,X7)).
% 0.16/0.31 cnf(a4, assumption,
% 0.16/0.31 X3 = X8).
% 0.16/0.31 cnf(a5, assumption,
% 0.16/0.31 X4 = X6).
% 0.16/0.31 cnf(a6, assumption,
% 0.16/0.31 X5 = X7).
% 0.16/0.31 cnf(c9, plain,
% 0.16/0.31 ~in(X4,relation_rng(relation_rng_restriction(X5,X3))),
% 0.16/0.31 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])).
% 0.16/0.31 cnf(c10, plain,
% 0.16/0.31 in(X6,X7),
% 0.16/0.31 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])).
% 0.16/0.31
% 0.16/0.31 cnf(c11, axiom,
% 0.16/0.31 subset(X9,X10) | ~in(sK2(X9,X10),X10)).
% 0.16/0.31 cnf(a7, assumption,
% 0.16/0.31 X6 = sK2(X9,X10)).
% 0.16/0.31 cnf(a8, assumption,
% 0.16/0.31 X7 = X10).
% 0.16/0.31 cnf(c12, plain,
% 0.16/0.31 $false,
% 0.16/0.31 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])).
% 0.16/0.31 cnf(c13, plain,
% 0.16/0.31 subset(X9,X10),
% 0.16/0.31 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])).
% 0.16/0.31
% 0.16/0.31 cnf(c14, axiom,
% 0.16/0.31 ~subset(relation_rng(relation_rng_restriction(sK10,sK11)),sK10)).
% 0.16/0.31 cnf(a9, assumption,
% 0.16/0.31 X9 = relation_rng(relation_rng_restriction(sK10,sK11))).
% 0.16/0.31 cnf(a10, assumption,
% 0.16/0.31 X10 = sK10).
% 0.16/0.31 cnf(c15, plain,
% 0.16/0.31 $false,
% 0.16/0.31 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c14])).
% 0.16/0.31 cnf(c16, plain,
% 0.16/0.31 $false,
% 0.16/0.31 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c14])).
% 0.16/0.31
% 0.16/0.31 cnf(c17, axiom,
% 0.16/0.31 subset(X11,X12) | in(sK2(X11,X12),X11)).
% 0.16/0.31 cnf(a11, assumption,
% 0.16/0.31 X4 = sK2(X11,X12)).
% 0.16/0.31 cnf(a12, assumption,
% 0.16/0.31 relation_rng(relation_rng_restriction(X5,X3)) = X11).
% 0.16/0.31 cnf(c18, plain,
% 0.16/0.31 $false,
% 0.16/0.31 inference(strict_predicate_extension, [assumptions([a11, a12])], [c9, c17])).
% 0.16/0.31 cnf(c19, plain,
% 0.16/0.31 subset(X11,X12),
% 0.16/0.31 inference(strict_predicate_extension, [assumptions([a11, a12])], [c9, c17])).
% 0.16/0.31
% 0.16/0.31 cnf(c20, plain,
% 0.16/0.31 ~subset(X9,X10)).
% 0.16/0.31 cnf(a13, assumption,
% 0.16/0.31 X11 = X9).
% 0.16/0.31 cnf(a14, assumption,
% 0.16/0.31 X12 = X10).
% 0.16/0.31 cnf(c21, plain,
% 0.16/0.31 $false,
% 0.16/0.31 inference(predicate_reduction, [assumptions([a13, a14])], [c19, c20])).
% 0.16/0.31
% 0.16/0.31 cnf(c22, plain,
% 0.16/0.31 $false,
% 0.16/0.31 inference(constraint_solving, [
% 0.16/0.31 bind(X0, sK10),
% 0.16/0.31 bind(X1, sK2(X9,X10)),
% 0.16/0.31 bind(X2, sK11),
% 0.16/0.31 bind(X3, sK11),
% 0.16/0.31 bind(X4, sK2(X9,X10)),
% 0.16/0.31 bind(X5, sK10),
% 0.16/0.31 bind(X6, sK2(X9,X10)),
% 0.16/0.31 bind(X7, sK10),
% 0.16/0.31 bind(X8, sK11),
% 0.16/0.31 bind(X9, relation_rng(relation_rng_restriction(sK10,sK11))),
% 0.16/0.31 bind(X10, sK10),
% 0.16/0.31 bind(X11, relation_rng(relation_rng_restriction(sK10,sK11))),
% 0.16/0.31 bind(X12, sK10)
% 0.16/0.31 ],
% 0.16/0.31 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])).
% 0.16/0.31
% 0.16/0.31 % SZS output end IncompleteProof
%------------------------------------------------------------------------------