%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : PLA022-1 : TPTP v8.1.0. Released v1.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 : Mon Jul 18 17:25:40 EDT 2022 % Result : Unsatisfiable 2.35s 0.66s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : PLA022-1 : TPTP v8.1.0. Released v1.1.0. % 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n018.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 : Tue May 31 23:29:28 EDT 2022 % 0.12/0.33 % CPUTime : % 2.35/0.66 % SZS status Unsatisfiable % 2.35/0.66 % SZS output begin IncompleteProof % 2.35/0.66 cnf(c0, axiom, % 2.35/0.66 ~holds(and(on(c,d),on(a,c)),X0)). % 2.35/0.66 cnf(c1, plain, % 2.35/0.66 ~holds(and(on(c,d),on(a,c)),X0), % 2.35/0.66 inference(start, [], [c0])). % 2.35/0.66 % 2.35/0.66 cnf(c2, axiom, % 2.35/0.66 ~holds(X1,X2) | ~holds(X3,X2) | holds(and(X3,X1),X2)). % 2.35/0.66 cnf(a0, assumption, % 2.35/0.66 and(on(c,d),on(a,c)) = and(X3,X1)). % 2.35/0.66 cnf(a1, assumption, % 2.35/0.66 X0 = X2). % 2.35/0.66 cnf(c3, plain, % 2.35/0.66 $false, % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 2.35/0.66 cnf(c4, plain, % 2.35/0.66 ~holds(X1,X2) | ~holds(X3,X2), % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 2.35/0.66 % 2.35/0.66 cnf(c5, axiom, % 2.35/0.66 ~holds(clear(X4),X5) | ~holds(holding(X6),X5) | holds(on(X6,X4),do(putdown(X6,X4),X5))). % 2.35/0.66 cnf(a2, assumption, % 2.35/0.66 X1 = on(X6,X4)). % 2.35/0.66 cnf(a3, assumption, % 2.35/0.66 X2 = do(putdown(X6,X4),X5)). % 2.35/0.66 cnf(c6, plain, % 2.35/0.66 ~holds(X3,X2), % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 2.35/0.66 cnf(c7, plain, % 2.35/0.66 ~holds(clear(X4),X5) | ~holds(holding(X6),X5), % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 2.35/0.66 % 2.35/0.66 cnf(c8, axiom, % 2.35/0.66 ~differ(X7,X8) | ~holds(clear(X7),X9) | holds(clear(X7),do(pickup(X8),X9))). % 2.35/0.66 cnf(a4, assumption, % 2.35/0.66 clear(X4) = clear(X7)). % 2.35/0.66 cnf(a5, assumption, % 2.35/0.66 X5 = do(pickup(X8),X9)). % 2.35/0.66 cnf(c9, plain, % 2.35/0.66 ~holds(holding(X6),X5), % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 2.35/0.66 cnf(c10, plain, % 2.35/0.66 ~differ(X7,X8) | ~holds(clear(X7),X9), % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 2.35/0.66 % 2.35/0.66 cnf(c11, axiom, % 2.35/0.66 ~differ(X10,X11) | differ(X11,X10)). % 2.35/0.66 cnf(a6, assumption, % 2.35/0.66 X7 = X11). % 2.35/0.66 cnf(a7, assumption, % 2.35/0.66 X8 = X10). % 2.35/0.66 cnf(c12, plain, % 2.35/0.66 ~holds(clear(X7),X9), % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 2.35/0.66 cnf(c13, plain, % 2.35/0.66 ~differ(X10,X11), % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 2.35/0.66 % 2.35/0.66 cnf(c14, axiom, % 2.35/0.66 differ(a,c)). % 2.35/0.66 cnf(a8, assumption, % 2.35/0.66 X10 = a). % 2.35/0.66 cnf(a9, assumption, % 2.35/0.66 X11 = c). % 2.35/0.66 cnf(c15, plain, % 2.35/0.66 $false, % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])). % 2.35/0.66 cnf(c16, plain, % 2.35/0.66 $false, % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])). % 2.35/0.66 % 2.35/0.66 cnf(c17, axiom, % 2.35/0.66 holds(clear(c),s0)). % 2.35/0.66 cnf(a10, assumption, % 2.35/0.66 clear(X7) = clear(c)). % 2.35/0.66 cnf(a11, assumption, % 2.35/0.66 X9 = s0). % 2.35/0.66 cnf(c18, plain, % 2.35/0.66 $false, % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c17])). % 2.35/0.66 cnf(c19, plain, % 2.35/0.66 $false, % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c17])). % 2.35/0.66 % 2.35/0.66 cnf(c20, axiom, % 2.35/0.66 ~differ(X12,table) | ~holds(clear(X12),X13) | ~holds(empty,X13) | holds(holding(X12),do(pickup(X12),X13))). % 2.35/0.66 cnf(a12, assumption, % 2.35/0.66 holding(X6) = holding(X12)). % 2.35/0.66 cnf(a13, assumption, % 2.35/0.66 X5 = do(pickup(X12),X13)). % 2.35/0.66 cnf(c21, plain, % 2.35/0.66 $false, % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a12, a13])], [c9, c20])). % 2.35/0.66 cnf(c22, plain, % 2.35/0.66 ~differ(X12,table) | ~holds(clear(X12),X13) | ~holds(empty,X13), % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a12, a13])], [c9, c20])). % 2.35/0.66 % 2.35/0.66 cnf(c23, axiom, % 2.35/0.66 differ(a,table)). % 2.35/0.66 cnf(a14, assumption, % 2.35/0.66 X12 = a). % 2.35/0.66 cnf(a15, assumption, % 2.35/0.66 table = table). % 2.35/0.66 cnf(c24, plain, % 2.35/0.66 ~holds(clear(X12),X13) | ~holds(empty,X13), % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])). % 2.35/0.66 cnf(c25, plain, % 2.35/0.66 $false, % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])). % 2.35/0.66 % 2.35/0.66 cnf(c26, axiom, % 2.35/0.66 holds(clear(a),s0)). % 2.35/0.66 cnf(a16, assumption, % 2.35/0.66 clear(X12) = clear(a)). % 2.35/0.66 cnf(a17, assumption, % 2.35/0.66 X13 = s0). % 2.35/0.66 cnf(c27, plain, % 2.35/0.66 ~holds(empty,X13), % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c26])). % 2.35/0.66 cnf(c28, plain, % 2.35/0.66 $false, % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c26])). % 2.35/0.66 % 2.35/0.66 cnf(c29, axiom, % 2.35/0.66 holds(empty,s0)). % 2.35/0.66 cnf(a18, assumption, % 2.35/0.66 empty = empty). % 2.35/0.66 cnf(a19, assumption, % 2.35/0.66 X13 = s0). % 2.35/0.66 cnf(c30, plain, % 2.35/0.66 $false, % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a18, a19])], [c27, c29])). % 2.35/0.66 cnf(c31, plain, % 2.35/0.66 $false, % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a18, a19])], [c27, c29])). % 2.35/0.66 % 2.35/0.66 cnf(c32, axiom, % 2.35/0.66 ~holds(on(X14,X15),X16) | holds(on(X14,X15),do(putdown(X17,X18),X16))). % 2.35/0.66 cnf(a20, assumption, % 2.35/0.66 X3 = on(X14,X15)). % 2.35/0.66 cnf(a21, assumption, % 2.35/0.66 X2 = do(putdown(X17,X18),X16)). % 2.35/0.66 cnf(c33, plain, % 2.35/0.66 $false, % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a20, a21])], [c6, c32])). % 2.35/0.66 cnf(c34, plain, % 2.35/0.66 ~holds(on(X14,X15),X16), % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a20, a21])], [c6, c32])). % 2.35/0.66 % 2.35/0.66 cnf(c35, axiom, % 2.35/0.66 ~differ(X19,X20) | ~holds(on(X19,X21),X22) | holds(on(X19,X21),do(pickup(X20),X22))). % 2.35/0.66 cnf(a22, assumption, % 2.35/0.66 on(X14,X15) = on(X19,X21)). % 2.35/0.66 cnf(a23, assumption, % 2.35/0.66 X16 = do(pickup(X20),X22)). % 2.35/0.66 cnf(c36, plain, % 2.35/0.66 $false, % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a22, a23])], [c34, c35])). % 2.35/0.66 cnf(c37, plain, % 2.35/0.66 ~differ(X19,X20) | ~holds(on(X19,X21),X22), % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a22, a23])], [c34, c35])). % 2.35/0.66 % 2.35/0.66 cnf(c38, plain, % 2.35/0.66 differ(X7,X8)). % 2.35/0.66 cnf(a24, assumption, % 2.35/0.66 X19 = X7). % 2.35/0.66 cnf(a25, assumption, % 2.35/0.66 X20 = X8). % 2.35/0.66 cnf(c39, plain, % 2.35/0.66 ~holds(on(X19,X21),X22), % 2.35/0.66 inference(predicate_reduction, [assumptions([a24, a25])], [c37, c38])). % 2.35/0.66 % 2.35/0.66 cnf(c40, axiom, % 2.35/0.66 holds(on(c,d),s0)). % 2.35/0.66 cnf(a26, assumption, % 2.35/0.66 on(X19,X21) = on(c,d)). % 2.35/0.66 cnf(a27, assumption, % 2.35/0.66 X22 = s0). % 2.35/0.66 cnf(c41, plain, % 2.35/0.66 $false, % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a26, a27])], [c39, c40])). % 2.35/0.66 cnf(c42, plain, % 2.35/0.66 $false, % 2.35/0.66 inference(strict_predicate_extension, [assumptions([a26, a27])], [c39, c40])). % 2.35/0.66 % 2.35/0.66 cnf(c43, plain, % 2.35/0.66 $false, % 2.35/0.66 inference(constraint_solving, [ % 2.35/0.66 bind(X0, do(putdown(X6,X4),X5)), % 2.35/0.66 bind(X1, on(a,c)), % 2.35/0.66 bind(X2, do(putdown(X6,X4),X5)), % 2.35/0.66 bind(X3, on(c,d)), % 2.35/0.66 bind(X4, c), % 2.35/0.66 bind(X5, do(pickup(X8),X9)), % 2.35/0.66 bind(X6, a), % 2.35/0.66 bind(X7, c), % 2.35/0.66 bind(X8, a), % 2.35/0.66 bind(X9, s0), % 2.35/0.66 bind(X10, a), % 2.35/0.66 bind(X11, c), % 2.35/0.66 bind(X12, a), % 2.35/0.66 bind(X13, s0), % 2.35/0.66 bind(X14, c), % 2.35/0.66 bind(X15, d), % 2.35/0.66 bind(X16, do(pickup(X8),X9)), % 2.35/0.66 bind(X17, a), % 2.35/0.66 bind(X18, c), % 2.35/0.66 bind(X19, c), % 2.35/0.66 bind(X20, a), % 2.35/0.66 bind(X21, d), % 2.35/0.66 bind(X22, s0) % 2.35/0.66 ], % 2.35/0.66 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27])). % 2.35/0.66 % 2.35/0.66 % SZS output end IncompleteProof %------------------------------------------------------------------------------