%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET095-7 : TPTP v8.1.0. Bugfixed v2.1.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:43:43 EDT 2022 % Result : Unsatisfiable 0.22s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET095-7 : TPTP v8.1.0. Bugfixed v2.1.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n018.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sun Jul 10 05:22:12 EDT 2022 % 0.12/0.34 % CPUTime : % 0.22/0.37 % SZS status Unsatisfiable % 0.22/0.37 % SZS output begin IncompleteProof % 0.22/0.37 cnf(c0, axiom, % 0.22/0.37 ~subclass(unordered_pair(x,x),y)). % 0.22/0.37 cnf(c1, plain, % 0.22/0.37 ~subclass(unordered_pair(x,x),y), % 0.22/0.37 inference(start, [], [c0])). % 0.22/0.37 % 0.22/0.37 cnf(c2, axiom, % 0.22/0.37 subclass(unordered_pair(X0,X1),X2) | ~member(X1,X2) | ~member(X0,X2)). % 0.22/0.37 cnf(a0, assumption, % 0.22/0.37 unordered_pair(x,x) = unordered_pair(X0,X1)). % 0.22/0.37 cnf(a1, assumption, % 0.22/0.37 y = X2). % 0.22/0.37 cnf(c3, plain, % 0.22/0.37 $false, % 0.22/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.22/0.37 cnf(c4, plain, % 0.22/0.37 ~member(X1,X2) | ~member(X0,X2), % 0.22/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.22/0.37 % 0.22/0.37 cnf(c5, axiom, % 0.22/0.37 member(x,y)). % 0.22/0.37 cnf(a2, assumption, % 0.22/0.37 X1 = x). % 0.22/0.37 cnf(a3, assumption, % 0.22/0.37 X2 = y). % 0.22/0.37 cnf(c6, plain, % 0.22/0.37 ~member(X0,X2), % 0.22/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.22/0.37 cnf(c7, plain, % 0.22/0.37 $false, % 0.22/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.22/0.37 % 0.22/0.37 cnf(c8, plain, % 0.22/0.37 member(X1,X2)). % 0.22/0.37 cnf(a4, assumption, % 0.22/0.37 X0 = X1). % 0.22/0.37 cnf(a5, assumption, % 0.22/0.37 X2 = X2). % 0.22/0.37 cnf(c9, plain, % 0.22/0.37 $false, % 0.22/0.37 inference(predicate_reduction, [assumptions([a4, a5])], [c6, c8])). % 0.22/0.37 % 0.22/0.37 cnf(c10, plain, % 0.22/0.37 $false, % 0.22/0.37 inference(constraint_solving, [ % 0.22/0.37 bind(X0, x), % 0.22/0.37 bind(X1, x), % 0.22/0.37 bind(X2, y) % 0.22/0.37 ], % 0.22/0.37 [a0, a1, a2, a3, a4, a5])). % 0.22/0.37 % 0.22/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------