TSTP Solution File: SYN409+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN409+1 : TPTP v8.1.0. Released v2.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 : n019.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:10:28 EDT 2022
% Result : Theorem 0.13s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN409+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n019.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 : Tue Jul 12 06:34:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % SZS status Theorem
% 0.13/0.35 % SZS output begin IncompleteProof
% 0.13/0.35 cnf(c0, axiom,
% 0.13/0.35 ~f(sK1) | ~f(sK0) | ~f(sK2)).
% 0.13/0.35 cnf(c1, plain,
% 0.13/0.35 ~f(sK1) | ~f(sK0) | ~f(sK2),
% 0.13/0.35 inference(start, [], [c0])).
% 0.13/0.35
% 0.13/0.35 cnf(c2, axiom,
% 0.13/0.35 f(X0) | f(X1)).
% 0.13/0.35 cnf(a0, assumption,
% 0.13/0.35 sK1 = X0).
% 0.13/0.35 cnf(c3, plain,
% 0.13/0.35 ~f(sK0) | ~f(sK2),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35 cnf(c4, plain,
% 0.13/0.35 f(X1),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35
% 0.13/0.35 cnf(c5, plain,
% 0.13/0.35 ~f(sK1)).
% 0.13/0.35 cnf(a1, assumption,
% 0.13/0.35 X1 = sK1).
% 0.13/0.35 cnf(c6, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a1])], [c4, c5])).
% 0.13/0.35
% 0.13/0.35 cnf(c7, axiom,
% 0.13/0.35 f(X2) | f(X3)).
% 0.13/0.35 cnf(a2, assumption,
% 0.13/0.35 sK0 = X3).
% 0.13/0.35 cnf(c8, plain,
% 0.13/0.35 ~f(sK2),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c3, c7])).
% 0.13/0.35 cnf(c9, plain,
% 0.13/0.35 f(X2),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c3, c7])).
% 0.13/0.35
% 0.13/0.35 cnf(c10, plain,
% 0.13/0.35 ~f(sK0)).
% 0.13/0.35 cnf(a3, assumption,
% 0.13/0.35 X2 = sK0).
% 0.13/0.35 cnf(c11, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a3])], [c9, c10])).
% 0.13/0.35
% 0.13/0.35 cnf(c12, axiom,
% 0.13/0.35 f(X4) | f(X5)).
% 0.13/0.35 cnf(a4, assumption,
% 0.13/0.35 sK2 = X4).
% 0.13/0.35 cnf(c13, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c8, c12])).
% 0.13/0.35 cnf(c14, plain,
% 0.13/0.35 f(X5),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c8, c12])).
% 0.13/0.35
% 0.13/0.35 cnf(c15, plain,
% 0.13/0.35 ~f(sK2)).
% 0.13/0.35 cnf(a5, assumption,
% 0.13/0.35 X5 = sK2).
% 0.13/0.35 cnf(c16, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a5])], [c14, c15])).
% 0.13/0.35
% 0.13/0.35 cnf(c17, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(constraint_solving, [
% 0.13/0.35 bind(X0, sK1),
% 0.13/0.35 bind(X1, sK1),
% 0.13/0.35 bind(X2, sK0),
% 0.13/0.35 bind(X3, sK0),
% 0.13/0.35 bind(X4, sK2),
% 0.13/0.35 bind(X5, sK2)
% 0.13/0.35 ],
% 0.13/0.35 [a0, a1, a2, a3, a4, a5])).
% 0.13/0.35
% 0.13/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------