TSTP Solution File: SWV168+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV168+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 : n020.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 13.81s 2.18s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV168+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 16:44:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 13.81/2.18 % SZS status Theorem
% 13.81/2.18 % SZS output begin IncompleteProof
% 13.81/2.18 cnf(c0, axiom,
% 13.81/2.18 leq(n0,pv46)).
% 13.81/2.18 cnf(c1, plain,
% 13.81/2.18 leq(n0,pv46),
% 13.81/2.18 inference(start, [], [c0])).
% 13.81/2.18
% 13.81/2.18 cnf(c2, axiom,
% 13.81/2.18 init = a_select3(q_init,X0,X1) | ~leq(X1,n4) | ~leq(n0,X1) | ~leq(X0,n135299) | ~leq(n0,X0)).
% 13.81/2.18 cnf(a0, assumption,
% 13.81/2.18 n0 = n0).
% 13.81/2.18 cnf(a1, assumption,
% 13.81/2.18 pv46 = X0).
% 13.81/2.18 cnf(c3, plain,
% 13.81/2.18 $false,
% 13.81/2.18 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 13.81/2.18 cnf(c4, plain,
% 13.81/2.18 init = a_select3(q_init,X0,X1) | ~leq(X1,n4) | ~leq(n0,X1) | ~leq(X0,n135299),
% 13.81/2.18 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 13.81/2.18
% 13.81/2.18 cnf(c5, axiom,
% 13.81/2.18 init != a_select3(q_init,pv46,pv40)).
% 13.81/2.18 cnf(a2, assumption,
% 13.81/2.18 a_select3(q_init,pv46,pv40) = a_select3(q_init,X0,X1)).
% 13.81/2.18 cnf(a3, assumption,
% 13.81/2.18 init = X2).
% 13.81/2.18 cnf(c6, plain,
% 13.81/2.18 ~leq(X1,n4) | ~leq(n0,X1) | ~leq(X0,n135299),
% 13.81/2.18 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 13.81/2.18 cnf(c7, plain,
% 13.81/2.18 $false,
% 13.81/2.18 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 13.81/2.18 cnf(c8, plain,
% 13.81/2.18 init != X2,
% 13.81/2.18 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 13.81/2.18
% 13.81/2.18 cnf(a4, assumption,
% 13.81/2.18 init = X2).
% 13.81/2.18 cnf(c9, plain,
% 13.81/2.18 $false,
% 13.81/2.18 inference(reflexivity, [assumptions([a4])], [c8])).
% 13.81/2.18
% 13.81/2.18 cnf(c10, axiom,
% 13.81/2.18 leq(pv40,n4)).
% 13.81/2.18 cnf(a5, assumption,
% 13.81/2.18 X1 = pv40).
% 13.81/2.18 cnf(a6, assumption,
% 13.81/2.18 n4 = n4).
% 13.81/2.18 cnf(c11, plain,
% 13.81/2.18 ~leq(n0,X1) | ~leq(X0,n135299),
% 13.81/2.18 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c10])).
% 13.81/2.18 cnf(c12, plain,
% 13.81/2.18 $false,
% 13.81/2.18 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c10])).
% 13.81/2.18
% 13.81/2.18 cnf(c13, axiom,
% 13.81/2.18 leq(n0,pv40)).
% 13.81/2.18 cnf(a7, assumption,
% 13.81/2.18 n0 = n0).
% 13.81/2.18 cnf(a8, assumption,
% 13.81/2.18 X1 = pv40).
% 13.81/2.18 cnf(c14, plain,
% 13.81/2.18 ~leq(X0,n135299),
% 13.81/2.18 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c13])).
% 13.81/2.18 cnf(c15, plain,
% 13.81/2.18 $false,
% 13.81/2.18 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c13])).
% 13.81/2.18
% 13.81/2.18 cnf(c16, axiom,
% 13.81/2.18 leq(pv46,n135299)).
% 13.81/2.18 cnf(a9, assumption,
% 13.81/2.18 X0 = pv46).
% 13.81/2.18 cnf(a10, assumption,
% 13.81/2.18 n135299 = n135299).
% 13.81/2.18 cnf(c17, plain,
% 13.81/2.18 $false,
% 13.81/2.18 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c16])).
% 13.81/2.18 cnf(c18, plain,
% 13.81/2.18 $false,
% 13.81/2.18 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c16])).
% 13.81/2.18
% 13.81/2.18 cnf(c19, plain,
% 13.81/2.18 $false,
% 13.81/2.18 inference(constraint_solving, [
% 13.81/2.18 bind(X0, pv46),
% 13.81/2.18 bind(X1, pv40),
% 13.81/2.18 bind(X2, init)
% 13.81/2.18 ],
% 13.81/2.18 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 13.81/2.18
% 13.81/2.18 % SZS output end IncompleteProof
%------------------------------------------------------------------------------