TSTP Solution File: PLA022-2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : PLA022-2 : 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 : n023.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.45s 0.65s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : PLA022-2 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.20/0.35 % WCLimit : 600
% 0.20/0.35 % DateTime : Tue May 31 19:25:41 EDT 2022
% 0.20/0.35 % CPUTime :
% 2.45/0.65 % SZS status Unsatisfiable
% 2.45/0.65 % SZS output begin IncompleteProof
% 2.45/0.65 cnf(c0, axiom,
% 2.45/0.65 ~holds(and(on(a,c),on(c,d)),X0)).
% 2.45/0.65 cnf(c1, plain,
% 2.45/0.65 ~holds(and(on(a,c),on(c,d)),X0),
% 2.45/0.65 inference(start, [], [c0])).
% 2.45/0.65
% 2.45/0.65 cnf(c2, axiom,
% 2.45/0.65 ~holds(X1,X2) | ~holds(X3,X2) | holds(and(X3,X1),X2)).
% 2.45/0.65 cnf(a0, assumption,
% 2.45/0.65 and(on(a,c),on(c,d)) = and(X3,X1)).
% 2.45/0.65 cnf(a1, assumption,
% 2.45/0.65 X0 = X2).
% 2.45/0.65 cnf(c3, plain,
% 2.45/0.65 $false,
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.45/0.65 cnf(c4, plain,
% 2.45/0.65 ~holds(X1,X2) | ~holds(X3,X2),
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.45/0.65
% 2.45/0.65 cnf(c5, axiom,
% 2.45/0.65 ~holds(on(X4,X5),X6) | holds(on(X4,X5),do(putdown(X7,X8),X6))).
% 2.45/0.65 cnf(a2, assumption,
% 2.45/0.65 X1 = on(X4,X5)).
% 2.45/0.65 cnf(a3, assumption,
% 2.45/0.65 X2 = do(putdown(X7,X8),X6)).
% 2.45/0.65 cnf(c6, plain,
% 2.45/0.65 ~holds(X3,X2),
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 2.45/0.65 cnf(c7, plain,
% 2.45/0.65 ~holds(on(X4,X5),X6),
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 2.45/0.65
% 2.45/0.65 cnf(c8, axiom,
% 2.45/0.65 ~differ(X9,X10) | ~holds(on(X9,X11),X12) | holds(on(X9,X11),do(pickup(X10),X12))).
% 2.45/0.65 cnf(a4, assumption,
% 2.45/0.65 on(X4,X5) = on(X9,X11)).
% 2.45/0.65 cnf(a5, assumption,
% 2.45/0.65 X6 = do(pickup(X10),X12)).
% 2.45/0.65 cnf(c9, plain,
% 2.45/0.65 $false,
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 2.45/0.65 cnf(c10, plain,
% 2.45/0.65 ~differ(X9,X10) | ~holds(on(X9,X11),X12),
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 2.45/0.65
% 2.45/0.65 cnf(c11, axiom,
% 2.45/0.65 ~differ(X13,X14) | differ(X14,X13)).
% 2.45/0.65 cnf(a6, assumption,
% 2.45/0.65 X9 = X14).
% 2.45/0.65 cnf(a7, assumption,
% 2.45/0.65 X10 = X13).
% 2.45/0.65 cnf(c12, plain,
% 2.45/0.65 ~holds(on(X9,X11),X12),
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 2.45/0.65 cnf(c13, plain,
% 2.45/0.65 ~differ(X13,X14),
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 2.45/0.65
% 2.45/0.65 cnf(c14, axiom,
% 2.45/0.65 differ(a,c)).
% 2.45/0.65 cnf(a8, assumption,
% 2.45/0.65 X13 = a).
% 2.45/0.65 cnf(a9, assumption,
% 2.45/0.65 X14 = c).
% 2.45/0.65 cnf(c15, plain,
% 2.45/0.65 $false,
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 2.45/0.65 cnf(c16, plain,
% 2.45/0.65 $false,
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 2.45/0.65
% 2.45/0.65 cnf(c17, axiom,
% 2.45/0.65 holds(on(c,d),s0)).
% 2.45/0.65 cnf(a10, assumption,
% 2.45/0.65 on(X9,X11) = on(c,d)).
% 2.45/0.65 cnf(a11, assumption,
% 2.45/0.65 X12 = s0).
% 2.45/0.65 cnf(c18, plain,
% 2.45/0.65 $false,
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c17])).
% 2.45/0.65 cnf(c19, plain,
% 2.45/0.65 $false,
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c17])).
% 2.45/0.65
% 2.45/0.65 cnf(c20, axiom,
% 2.45/0.65 ~holds(clear(X15),X16) | ~holds(holding(X17),X16) | holds(on(X17,X15),do(putdown(X17,X15),X16))).
% 2.45/0.65 cnf(a12, assumption,
% 2.45/0.65 X3 = on(X17,X15)).
% 2.45/0.65 cnf(a13, assumption,
% 2.45/0.65 X2 = do(putdown(X17,X15),X16)).
% 2.45/0.65 cnf(c21, plain,
% 2.45/0.65 $false,
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c20])).
% 2.45/0.65 cnf(c22, plain,
% 2.45/0.65 ~holds(clear(X15),X16) | ~holds(holding(X17),X16),
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c20])).
% 2.45/0.65
% 2.45/0.65 cnf(c23, axiom,
% 2.45/0.65 ~differ(X18,X19) | ~holds(clear(X18),X20) | holds(clear(X18),do(pickup(X19),X20))).
% 2.45/0.65 cnf(a14, assumption,
% 2.45/0.65 clear(X15) = clear(X18)).
% 2.45/0.65 cnf(a15, assumption,
% 2.45/0.65 X16 = do(pickup(X19),X20)).
% 2.45/0.65 cnf(c24, plain,
% 2.45/0.65 ~holds(holding(X17),X16),
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])).
% 2.45/0.65 cnf(c25, plain,
% 2.45/0.65 ~differ(X18,X19) | ~holds(clear(X18),X20),
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])).
% 2.45/0.65
% 2.45/0.65 cnf(c26, plain,
% 2.45/0.65 differ(X9,X10)).
% 2.45/0.65 cnf(a16, assumption,
% 2.45/0.65 X18 = X9).
% 2.45/0.65 cnf(a17, assumption,
% 2.45/0.65 X19 = X10).
% 2.45/0.65 cnf(c27, plain,
% 2.45/0.65 ~holds(clear(X18),X20),
% 2.45/0.65 inference(predicate_reduction, [assumptions([a16, a17])], [c25, c26])).
% 2.45/0.65
% 2.45/0.65 cnf(c28, axiom,
% 2.45/0.65 holds(clear(c),s0)).
% 2.45/0.65 cnf(a18, assumption,
% 2.45/0.65 clear(X18) = clear(c)).
% 2.45/0.65 cnf(a19, assumption,
% 2.45/0.65 X20 = s0).
% 2.45/0.65 cnf(c29, plain,
% 2.45/0.65 $false,
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a18, a19])], [c27, c28])).
% 2.45/0.65 cnf(c30, plain,
% 2.45/0.65 $false,
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a18, a19])], [c27, c28])).
% 2.45/0.65
% 2.45/0.65 cnf(c31, axiom,
% 2.45/0.65 ~differ(X21,table) | ~holds(clear(X21),X22) | ~holds(empty,X22) | holds(holding(X21),do(pickup(X21),X22))).
% 2.45/0.65 cnf(a20, assumption,
% 2.45/0.65 holding(X17) = holding(X21)).
% 2.45/0.65 cnf(a21, assumption,
% 2.45/0.65 X16 = do(pickup(X21),X22)).
% 2.45/0.65 cnf(c32, plain,
% 2.45/0.65 $false,
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a20, a21])], [c24, c31])).
% 2.45/0.65 cnf(c33, plain,
% 2.45/0.65 ~differ(X21,table) | ~holds(clear(X21),X22) | ~holds(empty,X22),
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a20, a21])], [c24, c31])).
% 2.45/0.65
% 2.45/0.65 cnf(c34, axiom,
% 2.45/0.65 differ(a,table)).
% 2.45/0.65 cnf(a22, assumption,
% 2.45/0.65 X21 = a).
% 2.45/0.65 cnf(a23, assumption,
% 2.45/0.65 table = table).
% 2.45/0.65 cnf(c35, plain,
% 2.45/0.65 ~holds(clear(X21),X22) | ~holds(empty,X22),
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a22, a23])], [c33, c34])).
% 2.45/0.65 cnf(c36, plain,
% 2.45/0.65 $false,
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a22, a23])], [c33, c34])).
% 2.45/0.65
% 2.45/0.65 cnf(c37, axiom,
% 2.45/0.65 holds(clear(a),s0)).
% 2.45/0.65 cnf(a24, assumption,
% 2.45/0.65 clear(X21) = clear(a)).
% 2.45/0.65 cnf(a25, assumption,
% 2.45/0.65 X22 = s0).
% 2.45/0.65 cnf(c38, plain,
% 2.45/0.65 ~holds(empty,X22),
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a24, a25])], [c35, c37])).
% 2.45/0.65 cnf(c39, plain,
% 2.45/0.65 $false,
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a24, a25])], [c35, c37])).
% 2.45/0.65
% 2.45/0.65 cnf(c40, axiom,
% 2.45/0.65 holds(empty,s0)).
% 2.45/0.65 cnf(a26, assumption,
% 2.45/0.65 empty = empty).
% 2.45/0.65 cnf(a27, assumption,
% 2.45/0.65 X22 = s0).
% 2.45/0.65 cnf(c41, plain,
% 2.45/0.65 $false,
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a26, a27])], [c38, c40])).
% 2.45/0.65 cnf(c42, plain,
% 2.45/0.65 $false,
% 2.45/0.65 inference(strict_predicate_extension, [assumptions([a26, a27])], [c38, c40])).
% 2.45/0.65
% 2.45/0.65 cnf(c43, plain,
% 2.45/0.65 $false,
% 2.45/0.65 inference(constraint_solving, [
% 2.45/0.65 bind(X0, do(putdown(X7,X8),X6)),
% 2.45/0.65 bind(X1, on(c,d)),
% 2.45/0.65 bind(X2, do(putdown(X7,X8),X6)),
% 2.45/0.65 bind(X3, on(a,c)),
% 2.45/0.65 bind(X4, c),
% 2.45/0.65 bind(X5, d),
% 2.45/0.65 bind(X6, do(pickup(X10),X12)),
% 2.45/0.65 bind(X7, a),
% 2.45/0.65 bind(X8, c),
% 2.45/0.65 bind(X9, c),
% 2.45/0.65 bind(X10, a),
% 2.45/0.65 bind(X11, d),
% 2.45/0.65 bind(X12, s0),
% 2.45/0.65 bind(X13, a),
% 2.45/0.65 bind(X14, c),
% 2.45/0.65 bind(X15, c),
% 2.45/0.65 bind(X16, do(pickup(X10),X12)),
% 2.45/0.65 bind(X17, a),
% 2.45/0.65 bind(X18, c),
% 2.45/0.65 bind(X19, a),
% 2.45/0.65 bind(X20, s0),
% 2.45/0.65 bind(X21, a),
% 2.45/0.65 bind(X22, s0)
% 2.45/0.65 ],
% 2.45/0.65 [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.45/0.65
% 2.45/0.65 % SZS output end IncompleteProof
%------------------------------------------------------------------------------