TSTP Solution File: RNG087+2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : RNG087+2 : TPTP v8.1.0. Released v4.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 : n026.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 : Mon Jul 18 20:33:31 EDT 2022
% Result : Theorem 0.12s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : RNG087+2 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n026.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 : Mon May 30 13:42:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % SZS status Theorem
% 0.12/0.34 % SZS output begin IncompleteProof
% 0.12/0.34 cnf(c0, axiom,
% 0.12/0.34 sdtpldt0(X0,X1) != xy | ~aElementOf0(X1,xJ) | ~aElementOf0(X0,xI)).
% 0.12/0.34 cnf(c1, plain,
% 0.12/0.34 sdtpldt0(X0,X1) != xy | ~aElementOf0(X1,xJ) | ~aElementOf0(X0,xI),
% 0.12/0.34 inference(start, [], [c0])).
% 0.12/0.34
% 0.12/0.34 cnf(c2, axiom,
% 0.12/0.34 xy = sdtpldt0(sK21,sK22)).
% 0.12/0.34 cnf(a0, assumption,
% 0.12/0.34 sdtpldt0(X0,X1) = sdtpldt0(sK21,sK22)).
% 0.12/0.34 cnf(c3, plain,
% 0.12/0.34 ~aElementOf0(X1,xJ) | ~aElementOf0(X0,xI),
% 0.12/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34 cnf(c4, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34 cnf(c5, plain,
% 0.12/0.34 X2 != xy | X2 != xy,
% 0.12/0.34 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.34
% 0.12/0.34 cnf(a1, assumption,
% 0.12/0.34 X2 = xy).
% 0.12/0.34 cnf(c6, plain,
% 0.12/0.34 X2 != xy,
% 0.12/0.34 inference(reflexivity, [assumptions([a1])], [c5])).
% 0.12/0.34
% 0.12/0.34 cnf(a2, assumption,
% 0.12/0.34 X2 = xy).
% 0.12/0.34 cnf(c7, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(reflexivity, [assumptions([a2])], [c6])).
% 0.12/0.34
% 0.12/0.34 cnf(c8, axiom,
% 0.12/0.34 aElementOf0(sK22,xJ)).
% 0.12/0.34 cnf(a3, assumption,
% 0.12/0.34 X1 = sK22).
% 0.12/0.34 cnf(a4, assumption,
% 0.12/0.34 xJ = xJ).
% 0.12/0.34 cnf(c9, plain,
% 0.12/0.34 ~aElementOf0(X0,xI),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4])], [c3, c8])).
% 0.12/0.34 cnf(c10, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4])], [c3, c8])).
% 0.12/0.34
% 0.12/0.34 cnf(c11, axiom,
% 0.12/0.34 aElementOf0(sK21,xI)).
% 0.12/0.34 cnf(a5, assumption,
% 0.12/0.34 X0 = sK21).
% 0.12/0.34 cnf(a6, assumption,
% 0.12/0.34 xI = xI).
% 0.12/0.34 cnf(c12, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c11])).
% 0.12/0.34 cnf(c13, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c11])).
% 0.12/0.34
% 0.12/0.34 cnf(c14, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(constraint_solving, [
% 0.12/0.34 bind(X0, sK21),
% 0.12/0.34 bind(X1, sK22),
% 0.12/0.34 bind(X2, xy)
% 0.12/0.34 ],
% 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6])).
% 0.12/0.34
% 0.12/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------