TSTP Solution File: SET027+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET027+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n025.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:42:39 EDT 2022
% Result : Theorem 20.01s 2.92s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET027+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.00/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n025.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 20:15:46 EDT 2022
% 0.13/0.34 % CPUTime :
% 20.01/2.92 % SZS status Theorem
% 20.01/2.92 % SZS output begin IncompleteProof
% 20.01/2.92 cnf(c0, axiom,
% 20.01/2.92 ~subclass(sK9,sK11)).
% 20.01/2.92 cnf(c1, plain,
% 20.01/2.92 ~subclass(sK9,sK11),
% 20.01/2.92 inference(start, [], [c0])).
% 20.01/2.92
% 20.01/2.92 cnf(c2, axiom,
% 20.01/2.92 subclass(X0,X1) | ~member(sK2(X0,X1),X1)).
% 20.01/2.92 cnf(a0, assumption,
% 20.01/2.92 sK9 = X0).
% 20.01/2.92 cnf(a1, assumption,
% 20.01/2.92 sK11 = X1).
% 20.01/2.92 cnf(c3, plain,
% 20.01/2.92 $false,
% 20.01/2.92 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 20.01/2.92 cnf(c4, plain,
% 20.01/2.92 ~member(sK2(X0,X1),X1),
% 20.01/2.92 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 20.01/2.92
% 20.01/2.92 cnf(c5, axiom,
% 20.01/2.92 member(X2,X3) | ~member(X2,X4) | ~subclass(X4,X3)).
% 20.01/2.92 cnf(a2, assumption,
% 20.01/2.92 sK2(X0,X1) = X2).
% 20.01/2.92 cnf(a3, assumption,
% 20.01/2.92 X1 = X3).
% 20.01/2.92 cnf(c6, plain,
% 20.01/2.92 $false,
% 20.01/2.92 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 20.01/2.92 cnf(c7, plain,
% 20.01/2.92 ~member(X2,X4) | ~subclass(X4,X3),
% 20.01/2.92 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 20.01/2.92
% 20.01/2.92 cnf(c8, axiom,
% 20.01/2.92 member(X5,X6) | ~member(X5,X7) | ~subclass(X7,X6)).
% 20.01/2.92 cnf(a4, assumption,
% 20.01/2.92 X2 = X5).
% 20.01/2.92 cnf(a5, assumption,
% 20.01/2.92 X4 = X6).
% 20.01/2.92 cnf(c9, plain,
% 20.01/2.92 ~subclass(X4,X3),
% 20.01/2.92 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 20.01/2.92 cnf(c10, plain,
% 20.01/2.92 ~member(X5,X7) | ~subclass(X7,X6),
% 20.01/2.92 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 20.01/2.92
% 20.01/2.92 cnf(c11, axiom,
% 20.01/2.92 subclass(X8,X9) | member(sK2(X8,X9),X8)).
% 20.01/2.92 cnf(a6, assumption,
% 20.01/2.92 X5 = sK2(X8,X9)).
% 20.01/2.92 cnf(a7, assumption,
% 20.01/2.92 X7 = X8).
% 20.01/2.92 cnf(c12, plain,
% 20.01/2.92 ~subclass(X7,X6),
% 20.01/2.92 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 20.01/2.92 cnf(c13, plain,
% 20.01/2.92 subclass(X8,X9),
% 20.01/2.92 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 20.01/2.92
% 20.01/2.92 cnf(c14, plain,
% 20.01/2.92 ~subclass(sK9,sK11)).
% 20.01/2.92 cnf(a8, assumption,
% 20.01/2.92 X8 = sK9).
% 20.01/2.92 cnf(a9, assumption,
% 20.01/2.92 X9 = sK11).
% 20.01/2.92 cnf(c15, plain,
% 20.01/2.92 $false,
% 20.01/2.92 inference(predicate_reduction, [assumptions([a8, a9])], [c13, c14])).
% 20.01/2.92
% 20.01/2.92 cnf(c16, axiom,
% 20.01/2.92 subclass(sK9,sK10)).
% 20.01/2.92 cnf(a10, assumption,
% 20.01/2.92 X7 = sK9).
% 20.01/2.92 cnf(a11, assumption,
% 20.01/2.92 X6 = sK10).
% 20.01/2.92 cnf(c17, plain,
% 20.01/2.92 $false,
% 20.01/2.92 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c16])).
% 20.01/2.92 cnf(c18, plain,
% 20.01/2.92 $false,
% 20.01/2.92 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c16])).
% 20.01/2.92
% 20.01/2.92 cnf(c19, axiom,
% 20.01/2.92 subclass(sK10,sK11)).
% 20.01/2.92 cnf(a12, assumption,
% 20.01/2.92 X4 = sK10).
% 20.01/2.92 cnf(a13, assumption,
% 20.01/2.92 X3 = sK11).
% 20.01/2.92 cnf(c20, plain,
% 20.01/2.92 $false,
% 20.01/2.92 inference(strict_predicate_extension, [assumptions([a12, a13])], [c9, c19])).
% 20.01/2.92 cnf(c21, plain,
% 20.01/2.92 $false,
% 20.01/2.92 inference(strict_predicate_extension, [assumptions([a12, a13])], [c9, c19])).
% 20.01/2.92
% 20.01/2.92 cnf(c22, plain,
% 20.01/2.92 $false,
% 20.01/2.92 inference(constraint_solving, [
% 20.01/2.92 bind(X0, sK9),
% 20.01/2.92 bind(X1, sK11),
% 20.01/2.92 bind(X2, sK2(X0,X1)),
% 20.01/2.92 bind(X3, sK11),
% 20.01/2.92 bind(X4, sK10),
% 20.01/2.92 bind(X5, sK2(X0,X1)),
% 20.01/2.92 bind(X6, sK10),
% 20.01/2.92 bind(X7, sK9),
% 20.01/2.92 bind(X8, sK9),
% 20.01/2.92 bind(X9, sK11)
% 20.01/2.92 ],
% 20.01/2.92 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 20.01/2.92
% 20.01/2.92 % SZS output end IncompleteProof
%------------------------------------------------------------------------------