TSTP Solution File: SYN980+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN980+1 : TPTP v8.1.0. Released v3.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 : Thu Jul 21 08:14:32 EDT 2022
% Result : Theorem 0.12s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYN980+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 13:56:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % SZS status Theorem
% 0.12/0.34 % SZS output begin IncompleteProof
% 0.12/0.34 cnf(c0, axiom,
% 0.12/0.34 ~q(X0,X1) | ~p(X0,X1)).
% 0.12/0.34 cnf(c1, plain,
% 0.12/0.34 ~q(X0,X1) | ~p(X0,X1),
% 0.12/0.34 inference(start, [], [c0])).
% 0.12/0.34
% 0.12/0.34 cnf(c2, axiom,
% 0.12/0.34 q(f(sK0),sK0) | ~p(X2,X3)).
% 0.12/0.34 cnf(a0, assumption,
% 0.12/0.34 X0 = f(sK0)).
% 0.12/0.34 cnf(a1, assumption,
% 0.12/0.34 X1 = sK0).
% 0.12/0.34 cnf(c3, plain,
% 0.12/0.34 ~p(X0,X1),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.34 cnf(c4, plain,
% 0.12/0.34 ~p(X2,X3),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.34
% 0.12/0.34 cnf(c5, axiom,
% 0.12/0.34 p(f(X4),X4) | r(sK0)).
% 0.12/0.34 cnf(a2, assumption,
% 0.12/0.34 X2 = f(X4)).
% 0.12/0.34 cnf(a3, assumption,
% 0.12/0.34 X3 = X4).
% 0.12/0.34 cnf(c6, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.12/0.34 cnf(c7, plain,
% 0.12/0.34 r(sK0),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.12/0.34
% 0.12/0.34 cnf(c8, axiom,
% 0.12/0.34 p(f(X5),X5) | ~r(X5)).
% 0.12/0.34 cnf(a4, assumption,
% 0.12/0.34 sK0 = X5).
% 0.12/0.34 cnf(c9, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])).
% 0.12/0.34 cnf(c10, plain,
% 0.12/0.34 p(f(X5),X5),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])).
% 0.12/0.34
% 0.12/0.34 cnf(c11, plain,
% 0.12/0.34 ~p(X2,X3)).
% 0.12/0.34 cnf(a5, assumption,
% 0.12/0.34 f(X5) = X2).
% 0.12/0.34 cnf(a6, assumption,
% 0.12/0.34 X5 = X3).
% 0.12/0.34 cnf(c12, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(predicate_reduction, [assumptions([a5, a6])], [c10, c11])).
% 0.12/0.34
% 0.12/0.34 cnf(c13, plain,
% 0.12/0.34 p(X2,X3)).
% 0.12/0.34 cnf(a7, assumption,
% 0.12/0.34 X0 = X2).
% 0.12/0.34 cnf(a8, assumption,
% 0.12/0.34 X1 = X3).
% 0.12/0.34 cnf(c14, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(predicate_reduction, [assumptions([a7, a8])], [c3, c13])).
% 0.12/0.34
% 0.12/0.34 cnf(c15, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(constraint_solving, [
% 0.12/0.34 bind(X0, f(sK0)),
% 0.12/0.34 bind(X1, sK0),
% 0.12/0.34 bind(X2, f(X4)),
% 0.12/0.34 bind(X3, sK0),
% 0.12/0.34 bind(X4, sK0),
% 0.12/0.34 bind(X5, sK0)
% 0.12/0.34 ],
% 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.12/0.34
% 0.12/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------