TSTP Solution File: SYN343+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SYN343+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 : n022.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:54 EDT 2022
% Result : Theorem 0.13s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN343+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.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 20:42:55 EDT 2022
% 0.13/0.35 % 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 ~big_f(X0,X1) | ~big_f(X2,X2)).
% 0.13/0.35 cnf(c1, plain,
% 0.13/0.35 ~big_f(X0,X1) | ~big_f(X2,X2),
% 0.13/0.35 inference(start, [], [c0])).
% 0.13/0.35
% 0.13/0.35 cnf(c2, axiom,
% 0.13/0.35 big_f(X3,X3) | big_f(X3,X4)).
% 0.13/0.35 cnf(a0, assumption,
% 0.13/0.35 X0 = X3).
% 0.13/0.35 cnf(a1, assumption,
% 0.13/0.35 X1 = X3).
% 0.13/0.35 cnf(c3, plain,
% 0.13/0.35 ~big_f(X2,X2),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.35 cnf(c4, plain,
% 0.13/0.35 big_f(X3,X4),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.35
% 0.13/0.35 cnf(c5, plain,
% 0.13/0.35 ~big_f(X0,X1)).
% 0.13/0.35 cnf(a2, assumption,
% 0.13/0.35 X3 = X0).
% 0.13/0.35 cnf(a3, assumption,
% 0.13/0.35 X4 = X1).
% 0.13/0.35 cnf(c6, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.35
% 0.13/0.35 cnf(c7, plain,
% 0.13/0.35 big_f(X0,X1)).
% 0.13/0.35 cnf(a4, assumption,
% 0.13/0.35 X2 = X0).
% 0.13/0.35 cnf(a5, assumption,
% 0.13/0.35 X2 = X1).
% 0.13/0.35 cnf(c8, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a4, a5])], [c3, c7])).
% 0.13/0.35
% 0.13/0.35 cnf(c9, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(constraint_solving, [
% 0.13/0.35 bind(X0, X3),
% 0.13/0.35 bind(X1, X3),
% 0.13/0.35 bind(X2, X3),
% 0.13/0.35 bind(X3, X3),
% 0.13/0.35 bind(X4, X3)
% 0.13/0.35 ],
% 0.13/0.35 [a0, a1, a2, a3, a4, a5])).
% 0.13/0.36
% 0.13/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------