TSTP Solution File: SWV192+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV192+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 : n009.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:49 EDT 2022
% Result : Theorem 0.20s 0.56s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWV192+1 : TPTP v8.1.0. Bugfixed v3.3.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 : n009.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 : Wed Jun 15 19:38:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.56 % SZS status Theorem
% 0.20/0.56 % SZS output begin IncompleteProof
% 0.20/0.56 cnf(c0, axiom,
% 0.20/0.56 leq(n0,pv5)).
% 0.20/0.56 cnf(c1, plain,
% 0.20/0.56 leq(n0,pv5),
% 0.20/0.56 inference(start, [], [c0])).
% 0.20/0.56
% 0.20/0.56 cnf(c2, axiom,
% 0.20/0.56 n0 = X0 | ~leq(X0,n0) | ~leq(n0,X0)).
% 0.20/0.56 cnf(a0, assumption,
% 0.20/0.56 n0 = n0).
% 0.20/0.56 cnf(a1, assumption,
% 0.20/0.56 pv5 = X0).
% 0.20/0.56 cnf(c3, plain,
% 0.20/0.56 $false,
% 0.20/0.56 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.56 cnf(c4, plain,
% 0.20/0.56 n0 = X0 | ~leq(X0,n0),
% 0.20/0.56 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.56
% 0.20/0.56 cnf(c5, axiom,
% 0.20/0.56 gt(pv5,n0)).
% 0.20/0.56 cnf(a2, assumption,
% 0.20/0.56 pv5 = X0).
% 0.20/0.56 cnf(a3, assumption,
% 0.20/0.56 n0 = X1).
% 0.20/0.56 cnf(c6, plain,
% 0.20/0.56 ~leq(X0,n0),
% 0.20/0.56 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.56 cnf(c7, plain,
% 0.20/0.56 $false,
% 0.20/0.56 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.56 cnf(c8, plain,
% 0.20/0.56 gt(X1,n0),
% 0.20/0.56 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.56
% 0.20/0.56 cnf(c9, axiom,
% 0.20/0.56 ~gt(X2,X2)).
% 0.20/0.56 cnf(a4, assumption,
% 0.20/0.56 X1 = X2).
% 0.20/0.56 cnf(a5, assumption,
% 0.20/0.56 n0 = X2).
% 0.20/0.56 cnf(c10, plain,
% 0.20/0.56 $false,
% 0.20/0.56 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])).
% 0.20/0.56 cnf(c11, plain,
% 0.20/0.56 $false,
% 0.20/0.56 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c9])).
% 0.20/0.56
% 0.20/0.56 cnf(c12, axiom,
% 0.20/0.56 leq(pv5,n0)).
% 0.20/0.56 cnf(a6, assumption,
% 0.20/0.56 X0 = pv5).
% 0.20/0.56 cnf(a7, assumption,
% 0.20/0.56 n0 = n0).
% 0.20/0.56 cnf(c13, plain,
% 0.20/0.56 $false,
% 0.20/0.56 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c12])).
% 0.20/0.56 cnf(c14, plain,
% 0.20/0.56 $false,
% 0.20/0.56 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c12])).
% 0.20/0.56
% 0.20/0.56 cnf(c15, plain,
% 0.20/0.56 $false,
% 0.20/0.56 inference(constraint_solving, [
% 0.20/0.56 bind(X0, pv5),
% 0.20/0.56 bind(X1, n0),
% 0.20/0.56 bind(X2, n0)
% 0.20/0.56 ],
% 0.20/0.56 [a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.20/0.56
% 0.20/0.56 % SZS output end IncompleteProof
%------------------------------------------------------------------------------