TSTP Solution File: SET118-7 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET118-7 : TPTP v8.1.0. Bugfixed v7.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 : n024.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:00 EDT 2022
% Result : Unsatisfiable 0.19s 0.56s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SET118-7 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.09/0.11 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.11/0.32 % Computer : n024.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sat Jul 9 23:24:28 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.19/0.56 % SZS status Unsatisfiable
% 0.19/0.56 % SZS output begin IncompleteProof
% 0.19/0.56 cnf(c0, axiom,
% 0.19/0.56 ~member(x,universal_class)).
% 0.19/0.56 cnf(c1, plain,
% 0.19/0.56 ~member(x,universal_class),
% 0.19/0.56 inference(start, [], [c0])).
% 0.19/0.56
% 0.19/0.56 cnf(c2, axiom,
% 0.19/0.56 member(X0,X1) | ~member(X0,X2) | ~subclass(X2,X1)).
% 0.19/0.56 cnf(a0, assumption,
% 0.19/0.56 x = X0).
% 0.19/0.56 cnf(a1, assumption,
% 0.19/0.56 universal_class = X1).
% 0.19/0.56 cnf(c3, plain,
% 0.19/0.56 $false,
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.56 cnf(c4, plain,
% 0.19/0.56 ~member(X0,X2) | ~subclass(X2,X1),
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.56
% 0.19/0.56 cnf(c5, axiom,
% 0.19/0.56 member(x,cross_product(universal_class,universal_class))).
% 0.19/0.56 cnf(a2, assumption,
% 0.19/0.56 X0 = x).
% 0.19/0.56 cnf(a3, assumption,
% 0.19/0.56 X2 = cross_product(universal_class,universal_class)).
% 0.19/0.56 cnf(c6, plain,
% 0.19/0.56 ~subclass(X2,X1),
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.56 cnf(c7, plain,
% 0.19/0.56 $false,
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.56
% 0.19/0.56 cnf(c8, axiom,
% 0.19/0.56 subclass(X3,universal_class)).
% 0.19/0.56 cnf(a4, assumption,
% 0.19/0.56 X2 = X3).
% 0.19/0.56 cnf(a5, assumption,
% 0.19/0.56 X1 = universal_class).
% 0.19/0.56 cnf(c9, plain,
% 0.19/0.56 $false,
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.19/0.56 cnf(c10, plain,
% 0.19/0.56 $false,
% 0.19/0.56 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.19/0.56
% 0.19/0.56 cnf(c11, plain,
% 0.19/0.56 $false,
% 0.19/0.56 inference(constraint_solving, [
% 0.19/0.56 bind(X0, x),
% 0.19/0.56 bind(X1, universal_class),
% 0.19/0.56 bind(X2, cross_product(universal_class,universal_class)),
% 0.19/0.56 bind(X3, cross_product(universal_class,universal_class))
% 0.19/0.56 ],
% 0.19/0.56 [a0, a1, a2, a3, a4, a5])).
% 0.19/0.56
% 0.19/0.56 % SZS output end IncompleteProof
%------------------------------------------------------------------------------