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