TSTP Solution File: SEU130+2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU130+2 : 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 : n022.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:20 EDT 2022
% Result : Theorem 0.19s 0.41s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU130+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 03:29:01 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.41 % SZS status Theorem
% 0.19/0.41 % SZS output begin IncompleteProof
% 0.19/0.41 cnf(c0, axiom,
% 0.19/0.41 subset(sK10,sK11)).
% 0.19/0.41 cnf(c1, plain,
% 0.19/0.41 subset(sK10,sK11),
% 0.19/0.41 inference(start, [], [c0])).
% 0.19/0.41
% 0.19/0.41 cnf(c2, axiom,
% 0.19/0.41 subset(X0,set_intersection2(X1,X2)) | ~subset(X0,X2) | ~subset(X0,X1)).
% 0.19/0.41 cnf(a0, assumption,
% 0.19/0.41 sK10 = X0).
% 0.19/0.41 cnf(a1, assumption,
% 0.19/0.41 sK11 = X2).
% 0.19/0.41 cnf(c3, plain,
% 0.19/0.41 $false,
% 0.19/0.41 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.41 cnf(c4, plain,
% 0.19/0.41 subset(X0,set_intersection2(X1,X2)) | ~subset(X0,X1),
% 0.19/0.41 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.41
% 0.19/0.41 cnf(c5, axiom,
% 0.19/0.41 X3 = X4 | ~subset(X4,X3) | ~subset(X3,X4)).
% 0.19/0.41 cnf(a2, assumption,
% 0.19/0.41 X0 = X3).
% 0.19/0.41 cnf(a3, assumption,
% 0.19/0.41 set_intersection2(X1,X2) = X4).
% 0.19/0.41 cnf(c6, plain,
% 0.19/0.41 ~subset(X0,X1),
% 0.19/0.41 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.41 cnf(c7, plain,
% 0.19/0.41 X3 = X4 | ~subset(X4,X3),
% 0.19/0.41 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.41
% 0.19/0.41 cnf(c8, axiom,
% 0.19/0.41 sK10 != set_intersection2(sK10,sK11)).
% 0.19/0.41 cnf(a4, assumption,
% 0.19/0.41 set_intersection2(sK10,sK11) = X4).
% 0.19/0.41 cnf(c9, plain,
% 0.19/0.41 ~subset(X4,X3),
% 0.19/0.41 inference(strict_subterm_extension, [assumptions([a4])], [c7, c8])).
% 0.19/0.41 cnf(c10, plain,
% 0.19/0.41 $false,
% 0.19/0.41 inference(strict_subterm_extension, [assumptions([a4])], [c7, c8])).
% 0.19/0.41 cnf(c11, plain,
% 0.19/0.41 sK10 != X3,
% 0.19/0.41 inference(strict_subterm_extension, [assumptions([a4])], [c7, c8])).
% 0.19/0.41
% 0.19/0.41 cnf(a5, assumption,
% 0.19/0.41 sK10 = X3).
% 0.19/0.41 cnf(c12, plain,
% 0.19/0.41 $false,
% 0.19/0.41 inference(reflexivity, [assumptions([a5])], [c11])).
% 0.19/0.41
% 0.19/0.41 cnf(c13, axiom,
% 0.19/0.41 subset(set_intersection2(X5,X6),X5)).
% 0.19/0.41 cnf(a6, assumption,
% 0.19/0.41 X4 = set_intersection2(X5,X6)).
% 0.19/0.41 cnf(a7, assumption,
% 0.19/0.41 X3 = X5).
% 0.19/0.41 cnf(c14, plain,
% 0.19/0.41 $false,
% 0.19/0.41 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c13])).
% 0.19/0.41 cnf(c15, plain,
% 0.19/0.41 $false,
% 0.19/0.41 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c13])).
% 0.19/0.41
% 0.19/0.41 cnf(c16, axiom,
% 0.19/0.41 subset(X7,X7)).
% 0.19/0.41 cnf(a8, assumption,
% 0.19/0.41 X0 = X7).
% 0.19/0.41 cnf(a9, assumption,
% 0.19/0.41 X1 = X7).
% 0.19/0.41 cnf(c17, plain,
% 0.19/0.41 $false,
% 0.19/0.41 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c16])).
% 0.19/0.41 cnf(c18, plain,
% 0.19/0.41 $false,
% 0.19/0.41 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c16])).
% 0.19/0.41
% 0.19/0.41 cnf(c19, plain,
% 0.19/0.41 $false,
% 0.19/0.41 inference(constraint_solving, [
% 0.19/0.41 bind(X0, sK10),
% 0.19/0.41 bind(X1, sK10),
% 0.19/0.41 bind(X2, sK11),
% 0.19/0.41 bind(X3, sK10),
% 0.19/0.41 bind(X4, set_intersection2(X1,X2)),
% 0.19/0.41 bind(X5, sK10),
% 0.19/0.41 bind(X6, sK11),
% 0.19/0.41 bind(X7, sK10)
% 0.19/0.41 ],
% 0.19/0.41 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 0.19/0.41
% 0.19/0.41 % SZS output end IncompleteProof
%------------------------------------------------------------------------------