TSTP Solution File: SWV366+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV366+1 : TPTP v8.1.0. Released 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 : n003.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:46:41 EDT 2022
% Result : Theorem 51.89s 6.88s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV366+1 : TPTP v8.1.0. Released 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.16/0.36 % Computer : n003.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 600
% 0.16/0.36 % DateTime : Wed Jun 15 05:26:55 EDT 2022
% 0.16/0.36 % CPUTime :
% 51.89/6.88 % SZS status Theorem
% 51.89/6.88 % SZS output begin IncompleteProof
% 51.89/6.88 cnf(c0, axiom,
% 51.89/6.88 i(triple(sK6,insert_slb(sK5,pair(sK10,sK11)),sK8)) != i(triple(sK7,insert_slb(sK5,pair(sK10,sK11)),sK9))).
% 51.89/6.88 cnf(c1, plain,
% 51.89/6.88 i(triple(sK6,insert_slb(sK5,pair(sK10,sK11)),sK8)) != i(triple(sK7,insert_slb(sK5,pair(sK10,sK11)),sK9)),
% 51.89/6.88 inference(start, [], [c0])).
% 51.89/6.88
% 51.89/6.88 cnf(c2, axiom,
% 51.89/6.88 i(triple(X0,insert_slb(X1,pair(X2,X3)),X4)) = insert_pq(i(triple(X0,X1,X4)),X2)).
% 51.89/6.88 cnf(a0, assumption,
% 51.89/6.88 i(triple(sK7,insert_slb(sK5,pair(sK10,sK11)),sK9)) = i(triple(X0,insert_slb(X1,pair(X2,X3)),X4))).
% 51.89/6.88 cnf(c3, plain,
% 51.89/6.88 $false,
% 51.89/6.88 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 51.89/6.88 cnf(c4, plain,
% 51.89/6.88 $false,
% 51.89/6.88 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 51.89/6.88 cnf(c5, plain,
% 51.89/6.88 X5 != insert_pq(i(triple(X0,X1,X4)),X2) | i(triple(sK6,insert_slb(sK5,pair(sK10,sK11)),sK8)) != X5,
% 51.89/6.88 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 51.89/6.88
% 51.89/6.88 cnf(c6, axiom,
% 51.89/6.88 i(triple(X6,sK5,X7)) = i(triple(X8,sK5,X9))).
% 51.89/6.88 cnf(a1, assumption,
% 51.89/6.88 i(triple(X0,X1,X4)) = i(triple(X8,sK5,X9))).
% 51.89/6.88 cnf(c7, plain,
% 51.89/6.88 i(triple(sK6,insert_slb(sK5,pair(sK10,sK11)),sK8)) != X5,
% 51.89/6.88 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 51.89/6.88 cnf(c8, plain,
% 51.89/6.88 $false,
% 51.89/6.88 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 51.89/6.88 cnf(c9, plain,
% 51.89/6.88 X10 != i(triple(X6,sK5,X7)) | X5 != insert_pq(X10,X2),
% 51.89/6.88 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 51.89/6.88
% 51.89/6.88 cnf(a2, assumption,
% 51.89/6.88 X10 = i(triple(X6,sK5,X7))).
% 51.89/6.88 cnf(c10, plain,
% 51.89/6.88 X5 != insert_pq(X10,X2),
% 51.89/6.88 inference(reflexivity, [assumptions([a2])], [c9])).
% 51.89/6.88
% 51.89/6.88 cnf(a3, assumption,
% 51.89/6.88 X5 = insert_pq(X10,X2)).
% 51.89/6.88 cnf(c11, plain,
% 51.89/6.88 $false,
% 51.89/6.88 inference(reflexivity, [assumptions([a3])], [c10])).
% 51.89/6.88
% 51.89/6.88 cnf(c12, axiom,
% 51.89/6.88 i(triple(X11,insert_slb(X12,pair(X13,X14)),X15)) = insert_pq(i(triple(X11,X12,X15)),X13)).
% 51.89/6.88 cnf(a4, assumption,
% 51.89/6.88 i(triple(sK6,insert_slb(sK5,pair(sK10,sK11)),sK8)) = i(triple(X11,insert_slb(X12,pair(X13,X14)),X15))).
% 51.89/6.88 cnf(c13, plain,
% 51.89/6.88 $false,
% 51.89/6.88 inference(strict_function_extension, [assumptions([a4])], [c7, c12])).
% 51.89/6.88 cnf(c14, plain,
% 51.89/6.88 $false,
% 51.89/6.88 inference(strict_function_extension, [assumptions([a4])], [c7, c12])).
% 51.89/6.88 cnf(c15, plain,
% 51.89/6.88 X16 != insert_pq(i(triple(X11,X12,X15)),X13) | X16 != X5,
% 51.89/6.88 inference(strict_function_extension, [assumptions([a4])], [c7, c12])).
% 51.89/6.88
% 51.89/6.88 cnf(a5, assumption,
% 51.89/6.88 X16 = insert_pq(i(triple(X11,X12,X15)),X13)).
% 51.89/6.88 cnf(c16, plain,
% 51.89/6.88 X16 != X5,
% 51.89/6.88 inference(reflexivity, [assumptions([a5])], [c15])).
% 51.89/6.88
% 51.89/6.88 cnf(a6, assumption,
% 51.89/6.88 X16 = X5).
% 51.89/6.88 cnf(c17, plain,
% 51.89/6.88 $false,
% 51.89/6.88 inference(reflexivity, [assumptions([a6])], [c16])).
% 51.89/6.88
% 51.89/6.88 cnf(c18, plain,
% 51.89/6.88 $false,
% 51.89/6.88 inference(constraint_solving, [
% 51.89/6.88 bind(X0, sK7),
% 51.89/6.88 bind(X1, sK5),
% 51.89/6.88 bind(X2, sK10),
% 51.89/6.88 bind(X3, sK11),
% 51.89/6.88 bind(X4, sK9),
% 51.89/6.88 bind(X5, insert_pq(X10,X2)),
% 51.89/6.88 bind(X6, sK6),
% 51.89/6.88 bind(X7, sK8),
% 51.89/6.88 bind(X8, sK7),
% 51.89/6.88 bind(X9, sK9),
% 51.89/6.88 bind(X10, i(triple(X6,sK5,X7))),
% 51.89/6.88 bind(X11, sK6),
% 51.89/6.88 bind(X12, sK5),
% 51.89/6.88 bind(X13, sK10),
% 51.89/6.88 bind(X14, sK11),
% 51.89/6.88 bind(X15, sK8),
% 51.89/6.88 bind(X16, insert_pq(i(triple(X11,X12,X15)),X13))
% 51.89/6.88 ],
% 51.89/6.88 [a0, a1, a2, a3, a4, a5, a6])).
% 51.89/6.88
% 51.89/6.88 % SZS output end IncompleteProof
%------------------------------------------------------------------------------