TSTP Solution File: SYN063+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN063+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 : n025.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:07:45 EDT 2022
% Result : Theorem 0.21s 0.40s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN063+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 12 03:23:48 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.40 % SZS status Theorem
% 0.21/0.40 % SZS output begin IncompleteProof
% 0.21/0.40 cnf(c0, axiom,
% 0.21/0.40 sP3 | sP2).
% 0.21/0.40 cnf(c1, plain,
% 0.21/0.40 sP3 | sP2,
% 0.21/0.40 inference(start, [], [c0])).
% 0.21/0.40
% 0.21/0.40 cnf(c2, axiom,
% 0.21/0.40 ~sP3 | ~sP2).
% 0.21/0.40 cnf(c3, plain,
% 0.21/0.40 sP2,
% 0.21/0.40 inference(strict_predicate_extension, [], [c1, c2])).
% 0.21/0.40 cnf(c4, plain,
% 0.21/0.40 ~sP2,
% 0.21/0.40 inference(strict_predicate_extension, [], [c1, c2])).
% 0.21/0.40
% 0.21/0.40 cnf(c5, axiom,
% 0.21/0.40 sP2 | ~big_p(c)).
% 0.21/0.40 cnf(c6, plain,
% 0.21/0.40 $false,
% 0.21/0.40 inference(strict_predicate_extension, [], [c4, c5])).
% 0.21/0.40 cnf(c7, plain,
% 0.21/0.40 ~big_p(c),
% 0.21/0.40 inference(strict_predicate_extension, [], [c4, c5])).
% 0.21/0.40
% 0.21/0.40 cnf(c8, axiom,
% 0.21/0.40 big_p(c) | big_p(X0) | ~big_p(a) | ~sP0(X0)).
% 0.21/0.40 cnf(a0, assumption,
% 0.21/0.40 c = c).
% 0.21/0.40 cnf(c9, plain,
% 0.21/0.40 $false,
% 0.21/0.40 inference(strict_predicate_extension, [assumptions([a0])], [c7, c8])).
% 0.21/0.40 cnf(c10, plain,
% 0.21/0.40 big_p(X0) | ~big_p(a) | ~sP0(X0),
% 0.21/0.40 inference(strict_predicate_extension, [assumptions([a0])], [c7, c8])).
% 0.21/0.40
% 0.21/0.40 cnf(c11, plain,
% 0.21/0.40 ~big_p(c)).
% 0.21/0.40 cnf(a1, assumption,
% 0.21/0.40 X0 = c).
% 0.21/0.40 cnf(c12, plain,
% 0.21/0.40 ~big_p(a) | ~sP0(X0),
% 0.21/0.40 inference(predicate_reduction, [assumptions([a1])], [c10, c11])).
% 0.21/0.40
% 0.21/0.40 cnf(c13, axiom,
% 0.21/0.40 sP2 | big_p(a)).
% 0.21/0.41 cnf(a2, assumption,
% 0.21/0.41 a = a).
% 0.21/0.41 cnf(c14, plain,
% 0.21/0.41 ~sP0(X0),
% 0.21/0.41 inference(strict_predicate_extension, [assumptions([a2])], [c12, c13])).
% 0.21/0.41 cnf(c15, plain,
% 0.21/0.41 sP2,
% 0.21/0.41 inference(strict_predicate_extension, [assumptions([a2])], [c12, c13])).
% 0.21/0.41
% 0.21/0.41 cnf(c16, plain,
% 0.21/0.41 ~sP2).
% 0.21/0.41 cnf(c17, plain,
% 0.21/0.41 $false,
% 0.21/0.41 inference(predicate_reduction, [], [c15, c16])).
% 0.21/0.41
% 0.21/0.41 cnf(c18, axiom,
% 0.21/0.41 sP0(X1) | ~sP3).
% 0.21/0.41 cnf(a3, assumption,
% 0.21/0.41 X0 = X1).
% 0.21/0.41 cnf(c19, plain,
% 0.21/0.41 $false,
% 0.21/0.41 inference(strict_predicate_extension, [assumptions([a3])], [c14, c18])).
% 0.21/0.41 cnf(c20, plain,
% 0.21/0.41 ~sP3,
% 0.21/0.41 inference(strict_predicate_extension, [assumptions([a3])], [c14, c18])).
% 0.21/0.41
% 0.21/0.41 cnf(c21, plain,
% 0.21/0.41 sP3).
% 0.21/0.41 cnf(c22, plain,
% 0.21/0.41 $false,
% 0.21/0.41 inference(predicate_reduction, [], [c20, c21])).
% 0.21/0.41
% 0.21/0.41 cnf(c23, axiom,
% 0.21/0.41 big_p(c) | big_p(X2) | ~big_p(a) | ~sP2).
% 0.21/0.41 cnf(c24, plain,
% 0.21/0.41 $false,
% 0.21/0.41 inference(strict_predicate_extension, [], [c3, c23])).
% 0.21/0.41 cnf(c25, plain,
% 0.21/0.41 big_p(c) | big_p(X2) | ~big_p(a),
% 0.21/0.41 inference(strict_predicate_extension, [], [c3, c23])).
% 0.21/0.41
% 0.21/0.41 cnf(c26, axiom,
% 0.21/0.41 sP0(X3) | ~big_p(c)).
% 0.21/0.41 cnf(a4, assumption,
% 0.21/0.41 c = c).
% 0.21/0.41 cnf(c27, plain,
% 0.21/0.41 big_p(X2) | ~big_p(a),
% 0.21/0.41 inference(strict_predicate_extension, [assumptions([a4])], [c25, c26])).
% 0.21/0.41 cnf(c28, plain,
% 0.21/0.41 sP0(X3),
% 0.21/0.41 inference(strict_predicate_extension, [assumptions([a4])], [c25, c26])).
% 0.21/0.41
% 0.21/0.41 cnf(c29, axiom,
% 0.21/0.41 sP3 | ~sP1 | ~sP0(sK4)).
% 0.21/0.41 cnf(a5, assumption,
% 0.21/0.41 X3 = sK4).
% 0.21/0.41 cnf(c30, plain,
% 0.21/0.41 $false,
% 0.21/0.41 inference(strict_predicate_extension, [assumptions([a5])], [c28, c29])).
% 0.21/0.41 cnf(c31, plain,
% 0.21/0.41 sP3 | ~sP1,
% 0.21/0.41 inference(strict_predicate_extension, [assumptions([a5])], [c28, c29])).
% 0.21/0.41
% 0.21/0.41 cnf(c32, plain,
% 0.21/0.41 ~sP3).
% 0.21/0.41 cnf(c33, plain,
% 0.21/0.41 ~sP1,
% 0.21/0.41 inference(predicate_reduction, [], [c31, c32])).
% 0.21/0.41
% 0.21/0.41 cnf(c34, axiom,
% 0.21/0.41 sP1 | ~big_p(c)).
% 0.21/0.41 cnf(c35, plain,
% 0.21/0.41 $false,
% 0.21/0.41 inference(strict_predicate_extension, [], [c33, c34])).
% 0.21/0.41 cnf(c36, plain,
% 0.21/0.41 ~big_p(c),
% 0.21/0.41 inference(strict_predicate_extension, [], [c33, c34])).
% 0.21/0.41
% 0.21/0.41 cnf(c37, plain,
% 0.21/0.41 big_p(c)).
% 0.21/0.41 cnf(a6, assumption,
% 0.21/0.41 c = c).
% 0.21/0.41 cnf(c38, plain,
% 0.21/0.41 $false,
% 0.21/0.41 inference(predicate_reduction, [assumptions([a6])], [c36, c37])).
% 0.21/0.41
% 0.21/0.41 cnf(c39, plain,
% 0.21/0.41 ~big_p(c)).
% 0.21/0.41 cnf(a7, assumption,
% 0.21/0.41 X2 = c).
% 0.21/0.41 cnf(c40, plain,
% 0.21/0.41 ~big_p(a),
% 0.21/0.41 inference(predicate_reduction, [assumptions([a7])], [c27, c39])).
% 0.21/0.41
% 0.21/0.41 cnf(c41, axiom,
% 0.21/0.41 sP0(X4) | big_p(a)).
% 0.21/0.41 cnf(a8, assumption,
% 0.21/0.41 a = a).
% 0.21/0.41 cnf(c42, plain,
% 0.21/0.41 $false,
% 0.21/0.41 inference(strict_predicate_extension, [assumptions([a8])], [c40, c41])).
% 0.21/0.41 cnf(c43, plain,
% 0.21/0.41 sP0(X4),
% 0.21/0.41 inference(strict_predicate_extension, [assumptions([a8])], [c40, c41])).
% 0.21/0.41
% 0.21/0.41 cnf(c44, axiom,
% 0.21/0.41 sP3 | ~sP1 | ~sP0(sK4)).
% 0.21/0.41 cnf(a9, assumption,
% 0.21/0.41 X4 = sK4).
% 0.21/0.41 cnf(c45, plain,
% 0.21/0.41 $false,
% 0.21/0.41 inference(strict_predicate_extension, [assumptions([a9])], [c43, c44])).
% 0.21/0.41 cnf(c46, plain,
% 0.21/0.41 sP3 | ~sP1,
% 0.21/0.41 inference(strict_predicate_extension, [assumptions([a9])], [c43, c44])).
% 0.21/0.41
% 0.21/0.41 cnf(c47, plain,
% 0.21/0.41 ~sP3).
% 0.21/0.41 cnf(c48, plain,
% 0.21/0.41 ~sP1,
% 0.21/0.41 inference(predicate_reduction, [], [c46, c47])).
% 0.21/0.41
% 0.21/0.41 cnf(c49, axiom,
% 0.21/0.41 sP1 | big_p(a)).
% 0.21/0.41 cnf(c50, plain,
% 0.21/0.41 $false,
% 0.21/0.41 inference(strict_predicate_extension, [], [c48, c49])).
% 0.21/0.41 cnf(c51, plain,
% 0.21/0.41 big_p(a),
% 0.21/0.41 inference(strict_predicate_extension, [], [c48, c49])).
% 0.21/0.41
% 0.21/0.41 cnf(c52, plain,
% 0.21/0.41 ~big_p(a)).
% 0.21/0.41 cnf(a10, assumption,
% 0.21/0.41 a = a).
% 0.21/0.41 cnf(c53, plain,
% 0.21/0.41 $false,
% 0.21/0.41 inference(predicate_reduction, [assumptions([a10])], [c51, c52])).
% 0.21/0.41
% 0.21/0.41 cnf(c54, plain,
% 0.21/0.41 $false,
% 0.21/0.41 inference(constraint_solving, [
% 0.21/0.41 bind(X0, c),
% 0.21/0.41 bind(X1, c),
% 0.21/0.41 bind(X2, c),
% 0.21/0.41 bind(X3, sK4),
% 0.21/0.41 bind(X4, sK4)
% 0.21/0.41 ],
% 0.21/0.41 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 0.21/0.41
% 0.21/0.41 % SZS output end IncompleteProof
%------------------------------------------------------------------------------