TSTP Solution File: SWV172+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV172+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n021.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 : Wed Jul 20 19:45:45 EDT 2022
% Result : Theorem 0.23s 0.46s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV172+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.08/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.37 % Computer : n021.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 600
% 0.14/0.37 % DateTime : Wed Jun 15 19:09:14 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.23/0.46 % SZS status Theorem
% 0.23/0.46 % SZS output begin IncompleteProof
% 0.23/0.46 cnf(c0, axiom,
% 0.23/0.46 leq(n0,pv54)).
% 0.23/0.46 cnf(c1, plain,
% 0.23/0.46 leq(n0,pv54),
% 0.23/0.46 inference(start, [], [c0])).
% 0.23/0.46
% 0.23/0.46 cnf(c2, axiom,
% 0.23/0.46 init = a_select2(rho_init,X0) | ~leq(X0,n4) | ~leq(n0,X0)).
% 0.23/0.46 cnf(a0, assumption,
% 0.23/0.46 n0 = n0).
% 0.23/0.46 cnf(a1, assumption,
% 0.23/0.46 pv54 = X0).
% 0.23/0.46 cnf(c3, plain,
% 0.23/0.46 $false,
% 0.23/0.46 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.23/0.46 cnf(c4, plain,
% 0.23/0.46 init = a_select2(rho_init,X0) | ~leq(X0,n4),
% 0.23/0.46 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.23/0.46
% 0.23/0.46 cnf(c5, axiom,
% 0.23/0.46 init != a_select2(rho_init,pv54)).
% 0.23/0.46 cnf(a2, assumption,
% 0.23/0.46 a_select2(rho_init,pv54) = a_select2(rho_init,X0)).
% 0.23/0.46 cnf(a3, assumption,
% 0.23/0.46 init = X1).
% 0.23/0.46 cnf(c6, plain,
% 0.23/0.46 ~leq(X0,n4),
% 0.23/0.46 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.23/0.46 cnf(c7, plain,
% 0.23/0.46 $false,
% 0.23/0.46 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.23/0.46 cnf(c8, plain,
% 0.23/0.46 init != X1,
% 0.23/0.46 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.23/0.46
% 0.23/0.46 cnf(a4, assumption,
% 0.23/0.46 init = X1).
% 0.23/0.46 cnf(c9, plain,
% 0.23/0.46 $false,
% 0.23/0.46 inference(reflexivity, [assumptions([a4])], [c8])).
% 0.23/0.46
% 0.23/0.46 cnf(c10, axiom,
% 0.23/0.46 leq(pv54,n4)).
% 0.23/0.46 cnf(a5, assumption,
% 0.23/0.46 X0 = pv54).
% 0.23/0.46 cnf(a6, assumption,
% 0.23/0.46 n4 = n4).
% 0.23/0.46 cnf(c11, plain,
% 0.23/0.46 $false,
% 0.23/0.46 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c10])).
% 0.23/0.46 cnf(c12, plain,
% 0.23/0.46 $false,
% 0.23/0.46 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c10])).
% 0.23/0.46
% 0.23/0.46 cnf(c13, plain,
% 0.23/0.46 $false,
% 0.23/0.46 inference(constraint_solving, [
% 0.23/0.46 bind(X0, pv54),
% 0.23/0.46 bind(X1, init)
% 0.23/0.46 ],
% 0.23/0.46 [a0, a1, a2, a3, a4, a5, a6])).
% 0.23/0.46
% 0.23/0.46 % SZS output end IncompleteProof
%------------------------------------------------------------------------------