TSTP Solution File: SYN317+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN317+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 : n015.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:09:35 EDT 2022
% Result : Theorem 0.12s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN317+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n015.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 : Tue Jul 12 04:58:25 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 ~big_g(X0) | ~big_g(X1)).
% 0.12/0.34 cnf(c1, plain,
% 0.12/0.34 ~big_g(X0) | ~big_g(X1),
% 0.12/0.34 inference(start, [], [c0])).
% 0.12/0.34
% 0.12/0.34 cnf(c2, axiom,
% 0.12/0.34 big_g(sK1) | ~big_f(sK0) | big_g(sK2) | ~big_f(sK2)).
% 0.12/0.34 cnf(a0, assumption,
% 0.12/0.34 X0 = sK2).
% 0.12/0.34 cnf(c3, plain,
% 0.12/0.34 ~big_g(X1),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34 cnf(c4, plain,
% 0.12/0.34 big_g(sK1) | ~big_f(sK0) | ~big_f(sK2),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34
% 0.12/0.34 cnf(c5, axiom,
% 0.12/0.34 ~big_g(X2) | ~big_g(X3)).
% 0.12/0.34 cnf(a1, assumption,
% 0.12/0.34 sK1 = X3).
% 0.12/0.34 cnf(c6, plain,
% 0.12/0.34 ~big_f(sK0) | ~big_f(sK2),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.12/0.34 cnf(c7, plain,
% 0.12/0.34 ~big_g(X2),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.12/0.34
% 0.12/0.34 cnf(c8, plain,
% 0.12/0.34 big_g(sK1)).
% 0.12/0.34 cnf(a2, assumption,
% 0.12/0.34 X2 = sK1).
% 0.12/0.34 cnf(c9, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(predicate_reduction, [assumptions([a2])], [c7, c8])).
% 0.12/0.34
% 0.12/0.34 cnf(c10, axiom,
% 0.12/0.34 big_f(X4) | big_f(X5)).
% 0.12/0.34 cnf(a3, assumption,
% 0.12/0.34 sK0 = X4).
% 0.12/0.34 cnf(c11, plain,
% 0.12/0.34 ~big_f(sK2),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c6, c10])).
% 0.12/0.34 cnf(c12, plain,
% 0.12/0.34 big_f(X5),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c6, c10])).
% 0.12/0.34
% 0.12/0.34 cnf(c13, plain,
% 0.12/0.34 ~big_f(sK0)).
% 0.12/0.34 cnf(a4, assumption,
% 0.12/0.34 X5 = sK0).
% 0.12/0.34 cnf(c14, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(predicate_reduction, [assumptions([a4])], [c12, c13])).
% 0.12/0.34
% 0.12/0.34 cnf(c15, axiom,
% 0.12/0.34 big_f(X6) | big_f(X7)).
% 0.12/0.34 cnf(a5, assumption,
% 0.12/0.34 sK2 = X6).
% 0.12/0.34 cnf(c16, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5])], [c11, c15])).
% 0.12/0.34 cnf(c17, plain,
% 0.12/0.34 big_f(X7),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5])], [c11, c15])).
% 0.12/0.34
% 0.12/0.34 cnf(c18, plain,
% 0.12/0.34 ~big_f(sK2)).
% 0.12/0.34 cnf(a6, assumption,
% 0.12/0.34 X7 = sK2).
% 0.12/0.34 cnf(c19, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(predicate_reduction, [assumptions([a6])], [c17, c18])).
% 0.12/0.34
% 0.12/0.34 cnf(c20, plain,
% 0.12/0.34 big_g(X0)).
% 0.12/0.34 cnf(a7, assumption,
% 0.12/0.34 X1 = X0).
% 0.12/0.34 cnf(c21, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(predicate_reduction, [assumptions([a7])], [c3, c20])).
% 0.12/0.34
% 0.12/0.34 cnf(c22, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(constraint_solving, [
% 0.12/0.34 bind(X0, sK2),
% 0.12/0.34 bind(X1, sK2),
% 0.12/0.34 bind(X2, sK1),
% 0.12/0.34 bind(X3, sK1),
% 0.12/0.34 bind(X4, sK0),
% 0.12/0.34 bind(X5, sK0),
% 0.12/0.34 bind(X6, sK2),
% 0.12/0.34 bind(X7, sK2)
% 0.12/0.34 ],
% 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.12/0.34
% 0.12/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------