TSTP Solution File: SYN168-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN168-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 : Thu Jul 21 08:08:38 EDT 2022
% Result : Unsatisfiable 0.13s 0.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SYN168-1 : TPTP v8.1.0. Released v1.1.0.
% 0.08/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 21:56:29 EDT 2022
% 0.13/0.34 % 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 ~p3(X0,X1,b)).
% 0.13/0.36 cnf(c1, plain,
% 0.13/0.36 ~p3(X0,X1,b),
% 0.13/0.36 inference(start, [], [c0])).
% 0.13/0.36
% 0.13/0.36 cnf(c2, axiom,
% 0.13/0.36 ~n2(X2) | p3(X2,X2,X2)).
% 0.13/0.36 cnf(a0, assumption,
% 0.13/0.36 X0 = X2).
% 0.13/0.36 cnf(a1, assumption,
% 0.13/0.36 X1 = X2).
% 0.13/0.36 cnf(a2, assumption,
% 0.13/0.36 b = X2).
% 0.13/0.36 cnf(c3, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.13/0.36 cnf(c4, plain,
% 0.13/0.36 ~n2(X2),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.13/0.36
% 0.13/0.36 cnf(c5, axiom,
% 0.13/0.36 ~p1(X3,X4,X5) | n2(X5)).
% 0.13/0.36 cnf(a3, assumption,
% 0.13/0.36 X2 = X5).
% 0.13/0.36 cnf(c6, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c4, c5])).
% 0.13/0.36 cnf(c7, plain,
% 0.13/0.36 ~p1(X3,X4,X5),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c4, c5])).
% 0.13/0.36
% 0.13/0.36 cnf(c8, axiom,
% 0.13/0.36 ~q0(X6,X7) | p1(X7,X7,X7)).
% 0.13/0.36 cnf(a4, assumption,
% 0.13/0.36 X3 = X7).
% 0.13/0.36 cnf(a5, assumption,
% 0.13/0.36 X4 = X7).
% 0.13/0.36 cnf(a6, assumption,
% 0.13/0.36 X5 = X7).
% 0.13/0.36 cnf(c9, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])).
% 0.13/0.36 cnf(c10, plain,
% 0.13/0.36 ~q0(X6,X7),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])).
% 0.13/0.36
% 0.13/0.36 cnf(c11, axiom,
% 0.13/0.36 q0(b,b)).
% 0.13/0.36 cnf(a7, assumption,
% 0.13/0.36 X6 = b).
% 0.13/0.36 cnf(a8, assumption,
% 0.13/0.36 X7 = b).
% 0.13/0.36 cnf(c12, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])).
% 0.13/0.36 cnf(c13, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])).
% 0.13/0.36
% 0.13/0.36 cnf(c14, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(constraint_solving, [
% 0.13/0.36 bind(X0, b),
% 0.13/0.36 bind(X1, b),
% 0.13/0.36 bind(X2, b),
% 0.13/0.36 bind(X3, b),
% 0.13/0.36 bind(X4, b),
% 0.13/0.36 bind(X5, b),
% 0.13/0.36 bind(X6, b),
% 0.13/0.36 bind(X7, b)
% 0.13/0.36 ],
% 0.13/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.13/0.36
% 0.13/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------