%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET027+4 : TPTP v8.1.0. Released v2.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 : n018.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:41 EDT 2022 % Result : Theorem 6.31s 1.18s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET027+4 : TPTP v8.1.0. Released v2.2.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n018.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 08:53:57 EDT 2022 % 0.13/0.35 % CPUTime : % 6.31/1.18 % SZS status Theorem % 6.31/1.18 % SZS output begin IncompleteProof % 6.31/1.18 cnf(c0, axiom, % 6.31/1.18 subset(sK4,sK5)). % 6.31/1.18 cnf(c1, plain, % 6.31/1.18 subset(sK4,sK5), % 6.31/1.18 inference(start, [], [c0])). % 6.31/1.18 % 6.31/1.18 cnf(c2, axiom, % 6.31/1.18 member(X0,X1) | ~member(X0,X2) | ~subset(X2,X1)). % 6.31/1.18 cnf(a0, assumption, % 6.31/1.18 sK4 = X2). % 6.31/1.18 cnf(a1, assumption, % 6.31/1.18 sK5 = X1). % 6.31/1.18 cnf(c3, plain, % 6.31/1.18 $false, % 6.31/1.18 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 6.31/1.18 cnf(c4, plain, % 6.31/1.18 member(X0,X1) | ~member(X0,X2), % 6.31/1.18 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 6.31/1.18 % 6.31/1.18 cnf(c5, axiom, % 6.31/1.18 subset(X3,X4) | ~member(sK0(X3,X4),X4)). % 6.31/1.18 cnf(a2, assumption, % 6.31/1.18 X0 = sK0(X3,X4)). % 6.31/1.18 cnf(a3, assumption, % 6.31/1.18 X1 = X4). % 6.31/1.18 cnf(c6, plain, % 6.31/1.18 ~member(X0,X2), % 6.31/1.18 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 6.31/1.18 cnf(c7, plain, % 6.31/1.18 subset(X3,X4), % 6.31/1.18 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 6.31/1.18 % 6.31/1.18 cnf(c8, axiom, % 6.31/1.18 ~subset(sK3,sK5)). % 6.31/1.18 cnf(a4, assumption, % 6.31/1.18 X3 = sK3). % 6.31/1.18 cnf(a5, assumption, % 6.31/1.18 X4 = sK5). % 6.31/1.18 cnf(c9, plain, % 6.31/1.18 $false, % 6.31/1.18 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 6.31/1.18 cnf(c10, plain, % 6.31/1.18 $false, % 6.31/1.18 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 6.31/1.18 % 6.31/1.18 cnf(c11, axiom, % 6.31/1.18 member(X5,X6) | ~member(X5,X7) | ~subset(X7,X6)). % 6.31/1.18 cnf(a6, assumption, % 6.31/1.18 X0 = X5). % 6.31/1.18 cnf(a7, assumption, % 6.31/1.18 X2 = X6). % 6.31/1.18 cnf(c12, plain, % 6.31/1.18 $false, % 6.31/1.18 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])). % 6.31/1.18 cnf(c13, plain, % 6.31/1.18 ~member(X5,X7) | ~subset(X7,X6), % 6.31/1.18 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])). % 6.31/1.18 % 6.31/1.18 cnf(c14, axiom, % 6.31/1.18 subset(X8,X9) | member(sK0(X8,X9),X8)). % 6.31/1.18 cnf(a8, assumption, % 6.31/1.18 X5 = sK0(X8,X9)). % 6.31/1.18 cnf(a9, assumption, % 6.31/1.18 X7 = X8). % 6.31/1.18 cnf(c15, plain, % 6.31/1.18 ~subset(X7,X6), % 6.31/1.18 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])). % 6.31/1.18 cnf(c16, plain, % 6.31/1.18 subset(X8,X9), % 6.31/1.18 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])). % 6.31/1.18 % 6.31/1.18 cnf(c17, plain, % 6.31/1.18 ~subset(X3,X4)). % 6.31/1.18 cnf(a10, assumption, % 6.31/1.18 X8 = X3). % 6.31/1.18 cnf(a11, assumption, % 6.31/1.18 X9 = X4). % 6.31/1.18 cnf(c18, plain, % 6.31/1.18 $false, % 6.31/1.18 inference(predicate_reduction, [assumptions([a10, a11])], [c16, c17])). % 6.31/1.18 % 6.31/1.18 cnf(c19, axiom, % 6.31/1.18 subset(sK3,sK4)). % 6.31/1.18 cnf(a12, assumption, % 6.31/1.18 X7 = sK3). % 6.31/1.18 cnf(a13, assumption, % 6.31/1.18 X6 = sK4). % 6.31/1.18 cnf(c20, plain, % 6.31/1.18 $false, % 6.31/1.18 inference(strict_predicate_extension, [assumptions([a12, a13])], [c15, c19])). % 6.31/1.18 cnf(c21, plain, % 6.31/1.18 $false, % 6.31/1.18 inference(strict_predicate_extension, [assumptions([a12, a13])], [c15, c19])). % 6.31/1.18 % 6.31/1.18 cnf(c22, plain, % 6.31/1.18 $false, % 6.31/1.18 inference(constraint_solving, [ % 6.31/1.18 bind(X0, sK0(X3,X4)), % 6.31/1.18 bind(X1, sK5), % 6.31/1.18 bind(X2, sK4), % 6.31/1.18 bind(X3, sK3), % 6.31/1.18 bind(X4, sK5), % 6.31/1.18 bind(X5, sK0(X3,X4)), % 6.31/1.18 bind(X6, sK4), % 6.31/1.18 bind(X7, sK3), % 6.31/1.18 bind(X8, sK3), % 6.31/1.18 bind(X9, sK5) % 6.31/1.18 ], % 6.31/1.18 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])). % 6.31/1.18 % 6.31/1.18 % SZS output end IncompleteProof %------------------------------------------------------------------------------