TSTP Solution File: SET899+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET899+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 : n003.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:49:04 EDT 2022
% Result : Theorem 0.06s 0.26s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SET899+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.07 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.06/0.25 % Computer : n003.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 600
% 0.06/0.25 % DateTime : Sat Jul 9 23:42:13 EDT 2022
% 0.06/0.26 % CPUTime :
% 0.06/0.26 % SZS status Theorem
% 0.06/0.26 % SZS output begin IncompleteProof
% 0.06/0.26 cnf(c0, axiom,
% 0.06/0.26 subset(sK2,sK3)).
% 0.06/0.26 cnf(c1, plain,
% 0.06/0.26 subset(sK2,sK3),
% 0.06/0.26 inference(start, [], [c0])).
% 0.06/0.26
% 0.06/0.26 cnf(c2, axiom,
% 0.06/0.26 subset(X0,set_difference(X1,singleton(X2))) | in(X2,X0) | ~subset(X0,X1)).
% 0.06/0.26 cnf(a0, assumption,
% 0.06/0.26 sK2 = X0).
% 0.06/0.26 cnf(a1, assumption,
% 0.06/0.26 sK3 = X1).
% 0.06/0.26 cnf(c3, plain,
% 0.06/0.26 $false,
% 0.06/0.26 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.06/0.26 cnf(c4, plain,
% 0.06/0.26 subset(X0,set_difference(X1,singleton(X2))) | in(X2,X0),
% 0.06/0.26 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.06/0.26
% 0.06/0.26 cnf(c5, axiom,
% 0.06/0.26 ~subset(sK2,set_difference(sK3,singleton(sK4)))).
% 0.06/0.26 cnf(a2, assumption,
% 0.06/0.26 X0 = sK2).
% 0.06/0.26 cnf(a3, assumption,
% 0.06/0.26 set_difference(X1,singleton(X2)) = set_difference(sK3,singleton(sK4))).
% 0.06/0.26 cnf(c6, plain,
% 0.06/0.26 in(X2,X0),
% 0.06/0.26 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.06/0.26 cnf(c7, plain,
% 0.06/0.26 $false,
% 0.06/0.26 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.06/0.26
% 0.06/0.26 cnf(c8, axiom,
% 0.06/0.26 ~in(sK4,sK2)).
% 0.06/0.26 cnf(a4, assumption,
% 0.06/0.26 X2 = sK4).
% 0.06/0.26 cnf(a5, assumption,
% 0.06/0.26 X0 = sK2).
% 0.06/0.26 cnf(c9, plain,
% 0.06/0.26 $false,
% 0.06/0.26 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.06/0.26 cnf(c10, plain,
% 0.06/0.26 $false,
% 0.06/0.26 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.06/0.26
% 0.06/0.26 cnf(c11, plain,
% 0.06/0.26 $false,
% 0.06/0.26 inference(constraint_solving, [
% 0.06/0.26 bind(X0, sK2),
% 0.06/0.26 bind(X1, sK3),
% 0.06/0.26 bind(X2, sK4)
% 0.06/0.26 ],
% 0.06/0.26 [a0, a1, a2, a3, a4, a5])).
% 0.06/0.26
% 0.06/0.26 % SZS output end IncompleteProof
%------------------------------------------------------------------------------