TSTP Solution File: COM001-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : COM001-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 : n012.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 : Fri Jul 15 01:26:56 EDT 2022
% Result : Unsatisfiable 0.13s 0.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COM001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.35 % Computer : n012.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.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 16:58:54 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % SZS status Unsatisfiable
% 0.13/0.36 % SZS output begin IncompleteProof
% 0.13/0.36 cnf(c0, axiom,
% 0.13/0.36 ~succeeds(p3,p3)).
% 0.13/0.36 cnf(c1, plain,
% 0.13/0.36 ~succeeds(p3,p3),
% 0.13/0.36 inference(start, [], [c0])).
% 0.13/0.36
% 0.13/0.36 cnf(c2, axiom,
% 0.13/0.36 ~succeeds(X0,X1) | ~succeeds(X2,X0) | succeeds(X2,X1)).
% 0.13/0.36 cnf(a0, assumption,
% 0.13/0.36 p3 = X2).
% 0.13/0.36 cnf(a1, assumption,
% 0.13/0.36 p3 = X1).
% 0.13/0.36 cnf(c3, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.36 cnf(c4, plain,
% 0.13/0.36 ~succeeds(X0,X1) | ~succeeds(X2,X0),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.36
% 0.13/0.36 cnf(c5, axiom,
% 0.13/0.36 ~follows(X3,X4) | succeeds(X3,X4)).
% 0.13/0.36 cnf(a2, assumption,
% 0.13/0.36 X0 = X3).
% 0.13/0.36 cnf(a3, assumption,
% 0.13/0.36 X1 = X4).
% 0.13/0.36 cnf(c6, plain,
% 0.13/0.36 ~succeeds(X2,X0),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.36 cnf(c7, plain,
% 0.13/0.36 ~follows(X3,X4),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.36
% 0.13/0.36 cnf(c8, axiom,
% 0.13/0.36 follows(p8,p3)).
% 0.13/0.36 cnf(a4, assumption,
% 0.13/0.36 X3 = p8).
% 0.13/0.36 cnf(a5, assumption,
% 0.13/0.36 X4 = p3).
% 0.13/0.36 cnf(c9, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.13/0.36 cnf(c10, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.13/0.36
% 0.13/0.36 cnf(c11, axiom,
% 0.13/0.36 ~labels(X5,X6) | ~has(X7,goto(X5)) | succeeds(X6,X7)).
% 0.13/0.36 cnf(a6, assumption,
% 0.13/0.36 X2 = X6).
% 0.13/0.36 cnf(a7, assumption,
% 0.13/0.36 X0 = X7).
% 0.13/0.36 cnf(c12, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])).
% 0.13/0.36 cnf(c13, plain,
% 0.13/0.36 ~labels(X5,X6) | ~has(X7,goto(X5)),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])).
% 0.13/0.36
% 0.13/0.36 cnf(c14, axiom,
% 0.13/0.36 labels(loop,p3)).
% 0.13/0.36 cnf(a8, assumption,
% 0.13/0.36 X5 = loop).
% 0.13/0.36 cnf(a9, assumption,
% 0.13/0.36 X6 = p3).
% 0.13/0.36 cnf(c15, plain,
% 0.13/0.36 ~has(X7,goto(X5)),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 0.13/0.36 cnf(c16, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 0.13/0.36
% 0.13/0.36 cnf(c17, axiom,
% 0.13/0.36 has(p8,goto(loop))).
% 0.13/0.36 cnf(a10, assumption,
% 0.13/0.36 X7 = p8).
% 0.13/0.36 cnf(a11, assumption,
% 0.13/0.36 goto(X5) = goto(loop)).
% 0.13/0.36 cnf(c18, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 0.13/0.36 cnf(c19, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 0.13/0.36
% 0.13/0.36 cnf(c20, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(constraint_solving, [
% 0.13/0.36 bind(X0, p8),
% 0.13/0.36 bind(X1, p3),
% 0.13/0.36 bind(X2, p3),
% 0.13/0.36 bind(X3, p8),
% 0.13/0.36 bind(X4, p3),
% 0.13/0.36 bind(X5, loop),
% 0.13/0.36 bind(X6, p3),
% 0.13/0.36 bind(X7, p8)
% 0.13/0.36 ],
% 0.13/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 0.13/0.36
% 0.13/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------