%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : PLA020-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 : n024.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 0.13s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : PLA020-1 : TPTP v8.1.0. Released v1.1.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n024.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Tue May 31 23:06:36 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.34 % SZS status Unsatisfiable % 0.13/0.34 % SZS output begin IncompleteProof % 0.13/0.34 cnf(c0, axiom, % 0.13/0.34 ~holds(clear(d),X0)). % 0.13/0.34 cnf(c1, plain, % 0.13/0.34 ~holds(clear(d),X0), % 0.13/0.34 inference(start, [], [c0])). % 0.13/0.34 % 0.13/0.34 cnf(c2, axiom, % 0.13/0.34 ~holds(empty,X1) | ~holds(clear(X2),X1) | ~holds(on(X2,X3),X1) | holds(clear(X3),do(pickup(X2),X1))). % 0.13/0.34 cnf(a0, assumption, % 0.13/0.34 clear(d) = clear(X3)). % 0.13/0.34 cnf(a1, assumption, % 0.13/0.34 X0 = do(pickup(X2),X1)). % 0.13/0.34 cnf(c3, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.34 cnf(c4, plain, % 0.13/0.34 ~holds(empty,X1) | ~holds(clear(X2),X1) | ~holds(on(X2,X3),X1), % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.34 % 0.13/0.34 cnf(c5, axiom, % 0.13/0.34 holds(empty,s0)). % 0.13/0.34 cnf(a2, assumption, % 0.13/0.34 empty = empty). % 0.13/0.34 cnf(a3, assumption, % 0.13/0.34 X1 = s0). % 0.13/0.34 cnf(c6, plain, % 0.13/0.34 ~holds(clear(X2),X1) | ~holds(on(X2,X3),X1), % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.13/0.34 cnf(c7, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.13/0.34 % 0.13/0.34 cnf(c8, axiom, % 0.13/0.34 holds(clear(c),s0)). % 0.13/0.34 cnf(a4, assumption, % 0.13/0.34 clear(X2) = clear(c)). % 0.13/0.34 cnf(a5, assumption, % 0.13/0.34 X1 = s0). % 0.13/0.34 cnf(c9, plain, % 0.13/0.34 ~holds(on(X2,X3),X1), % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.13/0.34 cnf(c10, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.13/0.34 % 0.13/0.34 cnf(c11, axiom, % 0.13/0.34 holds(on(c,d),s0)). % 0.13/0.34 cnf(a6, assumption, % 0.13/0.34 on(X2,X3) = on(c,d)). % 0.13/0.34 cnf(a7, assumption, % 0.13/0.34 X1 = s0). % 0.13/0.34 cnf(c12, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 0.13/0.34 cnf(c13, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])). % 0.13/0.34 % 0.13/0.34 cnf(c14, plain, % 0.13/0.34 $false, % 0.13/0.34 inference(constraint_solving, [ % 0.13/0.34 bind(X0, do(pickup(X2),X1)), % 0.13/0.34 bind(X1, s0), % 0.13/0.34 bind(X2, c), % 0.13/0.34 bind(X3, d) % 0.13/0.34 ], % 0.13/0.34 [a0, a1, a2, a3, a4, a5, a6, a7])). % 0.13/0.34 % 0.13/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------