TSTP Solution File: SWV411+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWV411+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 : n025.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:49 EDT 2022
% Result : Theorem 37.41s 5.10s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV411+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 15 23:29:11 EDT 2022
% 0.13/0.35 % CPUTime :
% 37.41/5.10 % SZS status Theorem
% 37.41/5.10 % SZS output begin IncompleteProof
% 37.41/5.10 cnf(c0, axiom,
% 37.41/5.10 contains_slb(insert_slb(sK1,pair(sK3,sK4)),sK2)).
% 37.41/5.10 cnf(c1, plain,
% 37.41/5.10 contains_slb(insert_slb(sK1,pair(sK3,sK4)),sK2),
% 37.41/5.10 inference(start, [], [c0])).
% 37.41/5.10
% 37.41/5.10 cnf(c2, axiom,
% 37.41/5.10 X0 = X1 | contains_slb(X2,X1) | ~contains_slb(insert_slb(X2,pair(X0,X3)),X1)).
% 37.41/5.10 cnf(a0, assumption,
% 37.41/5.10 insert_slb(sK1,pair(sK3,sK4)) = insert_slb(X2,pair(X0,X3))).
% 37.41/5.10 cnf(a1, assumption,
% 37.41/5.10 sK2 = X1).
% 37.41/5.10 cnf(c3, plain,
% 37.41/5.10 $false,
% 37.41/5.10 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 37.41/5.10 cnf(c4, plain,
% 37.41/5.10 X0 = X1 | contains_slb(X2,X1),
% 37.41/5.10 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 37.41/5.10
% 37.41/5.10 cnf(c5, axiom,
% 37.41/5.10 ~pair_in_list(insert_slb(sK1,pair(sK3,sK4)),sK2,X4)).
% 37.41/5.10 cnf(a2, assumption,
% 37.41/5.10 sK2 = X1).
% 37.41/5.10 cnf(c6, plain,
% 37.41/5.10 contains_slb(X2,X1),
% 37.41/5.10 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])).
% 37.41/5.10 cnf(c7, plain,
% 37.41/5.10 $false,
% 37.41/5.10 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])).
% 37.41/5.10 cnf(c8, plain,
% 37.41/5.10 ~pair_in_list(insert_slb(sK1,pair(sK3,sK4)),X0,X4),
% 37.41/5.10 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])).
% 37.41/5.10
% 37.41/5.10 cnf(c9, axiom,
% 37.41/5.10 pair_in_list(insert_slb(X5,pair(X6,X7)),X8,X9) | ~sP0(X9,X7,X8,X6,X5)).
% 37.41/5.10 cnf(a3, assumption,
% 37.41/5.10 insert_slb(sK1,pair(sK3,sK4)) = insert_slb(X5,pair(X6,X7))).
% 37.41/5.10 cnf(a4, assumption,
% 37.41/5.10 X0 = X8).
% 37.41/5.10 cnf(a5, assumption,
% 37.41/5.10 X4 = X9).
% 37.41/5.10 cnf(c10, plain,
% 37.41/5.10 $false,
% 37.41/5.10 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c8, c9])).
% 37.41/5.10 cnf(c11, plain,
% 37.41/5.10 ~sP0(X9,X7,X8,X6,X5),
% 37.41/5.10 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c8, c9])).
% 37.41/5.10
% 37.41/5.10 cnf(c12, axiom,
% 37.41/5.10 sP0(X10,X10,X11,X11,X12)).
% 37.41/5.10 cnf(a6, assumption,
% 37.41/5.10 X9 = X10).
% 37.41/5.10 cnf(a7, assumption,
% 37.41/5.10 X7 = X10).
% 37.41/5.10 cnf(a8, assumption,
% 37.41/5.10 X8 = X11).
% 37.41/5.10 cnf(a9, assumption,
% 37.41/5.10 X6 = X11).
% 37.41/5.10 cnf(a10, assumption,
% 37.41/5.10 X5 = X12).
% 37.41/5.10 cnf(c13, plain,
% 37.41/5.10 $false,
% 37.41/5.10 inference(strict_predicate_extension, [assumptions([a6, a7, a8, a9, a10])], [c11, c12])).
% 37.41/5.10 cnf(c14, plain,
% 37.41/5.10 $false,
% 37.41/5.10 inference(strict_predicate_extension, [assumptions([a6, a7, a8, a9, a10])], [c11, c12])).
% 37.41/5.10
% 37.41/5.10 cnf(c15, axiom,
% 37.41/5.10 pair_in_list(sK1,X13,sK5(X13)) | ~contains_slb(sK1,X13)).
% 37.41/5.10 cnf(a11, assumption,
% 37.41/5.10 X2 = sK1).
% 37.41/5.10 cnf(a12, assumption,
% 37.41/5.10 X1 = X13).
% 37.41/5.10 cnf(c16, plain,
% 37.41/5.10 $false,
% 37.41/5.10 inference(strict_predicate_extension, [assumptions([a11, a12])], [c6, c15])).
% 37.41/5.10 cnf(c17, plain,
% 37.41/5.10 pair_in_list(sK1,X13,sK5(X13)),
% 37.41/5.10 inference(strict_predicate_extension, [assumptions([a11, a12])], [c6, c15])).
% 37.41/5.10
% 37.41/5.10 cnf(c18, axiom,
% 37.41/5.10 sP0(X14,X15,X16,X17,X18) | ~pair_in_list(X18,X16,X14)).
% 37.41/5.10 cnf(a13, assumption,
% 37.41/5.10 sK1 = X18).
% 37.41/5.10 cnf(a14, assumption,
% 37.41/5.10 X13 = X16).
% 37.41/5.10 cnf(a15, assumption,
% 37.41/5.10 sK5(X13) = X14).
% 37.41/5.10 cnf(c19, plain,
% 37.41/5.10 $false,
% 37.41/5.10 inference(strict_predicate_extension, [assumptions([a13, a14, a15])], [c17, c18])).
% 37.41/5.10 cnf(c20, plain,
% 37.41/5.10 sP0(X14,X15,X16,X17,X18),
% 37.41/5.10 inference(strict_predicate_extension, [assumptions([a13, a14, a15])], [c17, c18])).
% 37.41/5.10
% 37.41/5.10 cnf(c21, axiom,
% 37.41/5.10 pair_in_list(insert_slb(X19,pair(X20,X21)),X22,X23) | ~sP0(X23,X21,X22,X20,X19)).
% 37.41/5.10 cnf(a16, assumption,
% 37.41/5.10 X14 = X23).
% 37.41/5.10 cnf(a17, assumption,
% 37.41/5.10 X15 = X21).
% 37.41/5.10 cnf(a18, assumption,
% 37.41/5.10 X16 = X22).
% 37.41/5.10 cnf(a19, assumption,
% 37.41/5.10 X17 = X20).
% 37.41/5.10 cnf(a20, assumption,
% 37.41/5.10 X18 = X19).
% 37.41/5.10 cnf(c22, plain,
% 37.41/5.10 $false,
% 37.41/5.10 inference(strict_predicate_extension, [assumptions([a16, a17, a18, a19, a20])], [c20, c21])).
% 37.41/5.10 cnf(c23, plain,
% 37.41/5.10 pair_in_list(insert_slb(X19,pair(X20,X21)),X22,X23),
% 37.41/5.10 inference(strict_predicate_extension, [assumptions([a16, a17, a18, a19, a20])], [c20, c21])).
% 37.41/5.10
% 37.41/5.10 cnf(c24, axiom,
% 37.41/5.10 ~pair_in_list(insert_slb(sK1,pair(sK3,sK4)),sK2,X24)).
% 37.41/5.10 cnf(a21, assumption,
% 37.41/5.10 insert_slb(X19,pair(X20,X21)) = insert_slb(sK1,pair(sK3,sK4))).
% 37.41/5.10 cnf(a22, assumption,
% 37.41/5.10 X22 = sK2).
% 37.41/5.10 cnf(a23, assumption,
% 37.41/5.10 X23 = X24).
% 37.41/5.10 cnf(c25, plain,
% 37.41/5.10 $false,
% 37.41/5.10 inference(strict_predicate_extension, [assumptions([a21, a22, a23])], [c23, c24])).
% 37.41/5.10 cnf(c26, plain,
% 37.41/5.10 $false,
% 37.41/5.10 inference(strict_predicate_extension, [assumptions([a21, a22, a23])], [c23, c24])).
% 37.41/5.10
% 37.41/5.10 cnf(c27, plain,
% 37.41/5.10 $false,
% 37.41/5.10 inference(constraint_solving, [
% 37.41/5.10 bind(X0, sK3),
% 37.41/5.10 bind(X1, sK2),
% 37.41/5.10 bind(X2, sK1),
% 37.41/5.10 bind(X3, sK4),
% 37.41/5.10 bind(X4, sK4),
% 37.41/5.10 bind(X5, sK1),
% 37.41/5.10 bind(X6, sK3),
% 37.41/5.10 bind(X7, sK4),
% 37.41/5.10 bind(X8, sK3),
% 37.41/5.10 bind(X9, sK4),
% 37.41/5.10 bind(X10, sK4),
% 37.41/5.10 bind(X11, sK3),
% 37.41/5.10 bind(X12, sK1),
% 37.41/5.10 bind(X13, sK2),
% 37.41/5.10 bind(X14, sK5(X13)),
% 37.41/5.10 bind(X15, sK4),
% 37.41/5.10 bind(X16, sK2),
% 37.41/5.10 bind(X17, sK3),
% 37.41/5.10 bind(X18, sK1),
% 37.41/5.10 bind(X19, sK1),
% 37.41/5.10 bind(X20, sK3),
% 37.41/5.10 bind(X21, sK4),
% 37.41/5.10 bind(X22, sK2),
% 37.41/5.10 bind(X23, sK5(X13)),
% 37.41/5.10 bind(X24, sK5(X13))
% 37.41/5.10 ],
% 37.41/5.10 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23])).
% 37.41/5.10
% 37.41/5.10 % SZS output end IncompleteProof
%------------------------------------------------------------------------------