TSTP Solution File: PLA002-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : PLA002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n028.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:38 EDT 2022
% Result : Unsatisfiable 0.18s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : PLA002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.32 % Computer : n028.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Tue May 31 18:43:06 EDT 2022
% 0.13/0.32 % CPUTime :
% 0.18/0.34 % SZS status Unsatisfiable
% 0.18/0.34 % SZS output begin IncompleteProof
% 0.18/0.34 cnf(c0, axiom,
% 0.18/0.34 ~at(a,X0)).
% 0.18/0.34 cnf(c1, plain,
% 0.18/0.34 ~at(a,X0),
% 0.18/0.34 inference(start, [], [c0])).
% 0.18/0.34
% 0.18/0.34 cnf(c2, axiom,
% 0.18/0.34 at(a,drive(a,X1)) | ~at(b,X1)).
% 0.18/0.34 cnf(a0, assumption,
% 0.18/0.34 a = a).
% 0.18/0.34 cnf(a1, assumption,
% 0.18/0.34 X0 = drive(a,X1)).
% 0.18/0.34 cnf(c3, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.18/0.34 cnf(c4, plain,
% 0.18/0.34 ~at(b,X1),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.18/0.34
% 0.18/0.34 cnf(c5, axiom,
% 0.18/0.34 at(b,climb(b,X2)) | ~at(d,X2) | ~warm(X2)).
% 0.18/0.34 cnf(a2, assumption,
% 0.18/0.34 b = b).
% 0.18/0.34 cnf(a3, assumption,
% 0.18/0.34 X1 = climb(b,X2)).
% 0.18/0.34 cnf(c6, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.18/0.34 cnf(c7, plain,
% 0.18/0.34 ~at(d,X2) | ~warm(X2),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.18/0.34
% 0.18/0.34 cnf(c8, axiom,
% 0.18/0.34 at(d,go(d,X3)) | ~at(f,X3)).
% 0.18/0.34 cnf(a4, assumption,
% 0.18/0.34 d = d).
% 0.18/0.34 cnf(a5, assumption,
% 0.18/0.34 X2 = go(d,X3)).
% 0.18/0.34 cnf(c9, plain,
% 0.18/0.34 ~warm(X2),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.18/0.34 cnf(c10, plain,
% 0.18/0.34 ~at(f,X3),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.18/0.34
% 0.18/0.34 cnf(c11, axiom,
% 0.18/0.34 at(f,s0)).
% 0.18/0.34 cnf(a6, assumption,
% 0.18/0.34 f = f).
% 0.18/0.34 cnf(a7, assumption,
% 0.18/0.34 X3 = s0).
% 0.18/0.34 cnf(c12, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.18/0.34 cnf(c13, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.18/0.34
% 0.18/0.34 cnf(c14, axiom,
% 0.18/0.34 cold(X4) | warm(X5)).
% 0.18/0.34 cnf(a8, assumption,
% 0.18/0.34 X2 = X5).
% 0.18/0.34 cnf(c15, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a8])], [c9, c14])).
% 0.18/0.34 cnf(c16, plain,
% 0.18/0.34 cold(X4),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a8])], [c9, c14])).
% 0.18/0.34
% 0.18/0.34 cnf(c17, axiom,
% 0.18/0.34 at(b,skate(b,X6)) | ~at(c,X6) | ~cold(X6)).
% 0.18/0.34 cnf(a9, assumption,
% 0.18/0.34 X4 = X6).
% 0.18/0.34 cnf(c18, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a9])], [c16, c17])).
% 0.18/0.34 cnf(c19, plain,
% 0.18/0.34 at(b,skate(b,X6)) | ~at(c,X6),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a9])], [c16, c17])).
% 0.18/0.34
% 0.18/0.34 cnf(c20, axiom,
% 0.18/0.34 at(a,drive(a,X7)) | ~at(b,X7)).
% 0.18/0.34 cnf(a10, assumption,
% 0.18/0.34 b = b).
% 0.18/0.34 cnf(a11, assumption,
% 0.18/0.34 skate(b,X6) = X7).
% 0.18/0.34 cnf(c21, plain,
% 0.18/0.34 ~at(c,X6),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a10, a11])], [c19, c20])).
% 0.18/0.34 cnf(c22, plain,
% 0.18/0.34 at(a,drive(a,X7)),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a10, a11])], [c19, c20])).
% 0.18/0.34
% 0.18/0.34 cnf(c23, axiom,
% 0.18/0.34 ~at(a,X8)).
% 0.18/0.34 cnf(a12, assumption,
% 0.18/0.34 a = a).
% 0.18/0.34 cnf(a13, assumption,
% 0.18/0.34 drive(a,X7) = X8).
% 0.18/0.34 cnf(c24, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a12, a13])], [c22, c23])).
% 0.18/0.34 cnf(c25, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a12, a13])], [c22, c23])).
% 0.18/0.34
% 0.18/0.34 cnf(c26, axiom,
% 0.18/0.34 at(c,go(c,X9)) | ~at(d,X9)).
% 0.18/0.34 cnf(a14, assumption,
% 0.18/0.34 c = c).
% 0.18/0.34 cnf(a15, assumption,
% 0.18/0.34 X6 = go(c,X9)).
% 0.18/0.34 cnf(c27, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c26])).
% 0.18/0.34 cnf(c28, plain,
% 0.18/0.34 ~at(d,X9),
% 0.18/0.34 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c26])).
% 0.18/0.34
% 0.18/0.34 cnf(c29, plain,
% 0.18/0.34 at(d,X2)).
% 0.18/0.34 cnf(a16, assumption,
% 0.18/0.34 d = d).
% 0.18/0.34 cnf(a17, assumption,
% 0.18/0.34 X9 = X2).
% 0.18/0.34 cnf(c30, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(predicate_reduction, [assumptions([a16, a17])], [c28, c29])).
% 0.18/0.34
% 0.18/0.34 cnf(c31, plain,
% 0.18/0.34 $false,
% 0.18/0.34 inference(constraint_solving, [
% 0.18/0.34 bind(X0, drive(a,X1)),
% 0.18/0.34 bind(X1, climb(b,X2)),
% 0.18/0.34 bind(X2, go(d,X3)),
% 0.18/0.34 bind(X3, s0),
% 0.18/0.34 bind(X4, go(c,X9)),
% 0.18/0.34 bind(X5, go(d,X3)),
% 0.18/0.34 bind(X6, go(c,X9)),
% 0.18/0.34 bind(X7, skate(b,X6)),
% 0.18/0.34 bind(X8, drive(a,X7)),
% 0.18/0.34 bind(X9, go(d,X3))
% 0.18/0.34 ],
% 0.18/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 0.18/0.34
% 0.18/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------