TSTP Solution File: SWC406+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWC406+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n015.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 : Tue Jul 19 21:08:39 EDT 2022
% Result : Theorem 99.90s 14.44s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC406+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 20:14:07 EDT 2022
% 0.13/0.35 % CPUTime :
% 99.90/14.44 % SZS status Theorem
% 99.90/14.44 % SZS output begin IncompleteProof
% 99.90/14.44 cnf(c0, axiom,
% 99.90/14.44 sK91 = sK93).
% 99.90/14.44 cnf(c1, plain,
% 99.90/14.44 sK91 = sK93,
% 99.90/14.44 inference(start, [], [c0])).
% 99.90/14.44
% 99.90/14.44 cnf(c2, axiom,
% 99.90/14.44 sP42(X0,sK94,sK93) | ~ssItem(X0)).
% 99.90/14.44 cnf(a0, assumption,
% 99.90/14.44 sK93 = sK93).
% 99.90/14.44 cnf(a1, assumption,
% 99.90/14.44 sK91 = X1).
% 99.90/14.44 cnf(c3, plain,
% 99.90/14.44 $false,
% 99.90/14.44 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 99.90/14.44 cnf(c4, plain,
% 99.90/14.44 ~ssItem(X0),
% 99.90/14.44 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 99.90/14.44 cnf(c5, plain,
% 99.90/14.44 sP42(X0,sK94,X1),
% 99.90/14.44 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 99.90/14.44
% 99.90/14.44 cnf(c6, axiom,
% 99.90/14.44 sK92 = sK94).
% 99.90/14.44 cnf(a2, assumption,
% 99.90/14.44 sK94 = sK94).
% 99.90/14.44 cnf(c7, plain,
% 99.90/14.44 $false,
% 99.90/14.44 inference(strict_function_extension, [assumptions([a2])], [c5, c6])).
% 99.90/14.44 cnf(c8, plain,
% 99.90/14.44 $false,
% 99.90/14.44 inference(strict_function_extension, [assumptions([a2])], [c5, c6])).
% 99.90/14.44 cnf(c9, plain,
% 99.90/14.44 X2 != sK92 | sP42(X0,X2,X1),
% 99.90/14.44 inference(strict_function_extension, [assumptions([a2])], [c5, c6])).
% 99.90/14.44
% 99.90/14.44 cnf(a3, assumption,
% 99.90/14.44 X2 = sK92).
% 99.90/14.44 cnf(c10, plain,
% 99.90/14.44 sP42(X0,X2,X1),
% 99.90/14.44 inference(reflexivity, [assumptions([a3])], [c9])).
% 99.90/14.44
% 99.90/14.44 cnf(c11, axiom,
% 99.90/14.44 memberP(X3,X4) | ~memberP(X5,X4) | ~sP42(X4,X3,X5)).
% 99.90/14.44 cnf(a4, assumption,
% 99.90/14.44 X0 = X4).
% 99.90/14.44 cnf(a5, assumption,
% 99.90/14.44 X2 = X3).
% 99.90/14.44 cnf(a6, assumption,
% 99.90/14.44 X1 = X5).
% 99.90/14.44 cnf(c12, plain,
% 99.90/14.44 $false,
% 99.90/14.44 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c10, c11])).
% 99.90/14.44 cnf(c13, plain,
% 99.90/14.44 memberP(X3,X4) | ~memberP(X5,X4),
% 99.90/14.44 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c10, c11])).
% 99.90/14.44
% 99.90/14.44 cnf(c14, axiom,
% 99.90/14.44 ~memberP(sK92,sK95)).
% 99.90/14.44 cnf(a7, assumption,
% 99.90/14.44 X3 = sK92).
% 99.90/14.44 cnf(a8, assumption,
% 99.90/14.44 X4 = sK95).
% 99.90/14.44 cnf(c15, plain,
% 99.90/14.44 ~memberP(X5,X4),
% 99.90/14.44 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])).
% 99.90/14.44 cnf(c16, plain,
% 99.90/14.44 $false,
% 99.90/14.44 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])).
% 99.90/14.44
% 99.90/14.44 cnf(c17, axiom,
% 99.90/14.44 memberP(sK91,sK95)).
% 99.90/14.44 cnf(a9, assumption,
% 99.90/14.44 X5 = sK91).
% 99.90/14.44 cnf(a10, assumption,
% 99.90/14.44 X4 = sK95).
% 99.90/14.44 cnf(c18, plain,
% 99.90/14.44 $false,
% 99.90/14.44 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c17])).
% 99.90/14.44 cnf(c19, plain,
% 99.90/14.44 $false,
% 99.90/14.44 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c17])).
% 99.90/14.44
% 99.90/14.44 cnf(c20, axiom,
% 99.90/14.44 ssItem(sK95)).
% 99.90/14.44 cnf(a11, assumption,
% 99.90/14.44 X0 = sK95).
% 99.90/14.44 cnf(c21, plain,
% 99.90/14.44 $false,
% 99.90/14.44 inference(strict_predicate_extension, [assumptions([a11])], [c4, c20])).
% 99.90/14.44 cnf(c22, plain,
% 99.90/14.44 $false,
% 99.90/14.44 inference(strict_predicate_extension, [assumptions([a11])], [c4, c20])).
% 99.90/14.44
% 99.90/14.44 cnf(c23, plain,
% 99.90/14.44 $false,
% 99.90/14.44 inference(constraint_solving, [
% 99.90/14.44 bind(X0, sK95),
% 99.90/14.44 bind(X1, sK91),
% 99.90/14.44 bind(X2, sK92),
% 99.90/14.44 bind(X3, sK92),
% 99.90/14.44 bind(X4, sK95),
% 99.90/14.44 bind(X5, sK91)
% 99.90/14.44 ],
% 99.90/14.44 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 99.90/14.44
% 99.90/14.44 % SZS output end IncompleteProof
%------------------------------------------------------------------------------