TSTP Solution File: SWC411+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWC411+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 : n013.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:41 EDT 2022
% Result : Theorem 11.15s 1.96s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC411+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 12 14:47:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 11.15/1.96 % SZS status Theorem
% 11.15/1.96 % SZS output begin IncompleteProof
% 11.15/1.96 cnf(c0, axiom,
% 11.15/1.96 sK88 = sK90).
% 11.15/1.96 cnf(c1, plain,
% 11.15/1.96 sK88 = sK90,
% 11.15/1.96 inference(start, [], [c0])).
% 11.15/1.96
% 11.15/1.96 cnf(c2, axiom,
% 11.15/1.96 ~memberP(sK91,X0) | memberP(sK90,X0) | ~ssItem(X0)).
% 11.15/1.96 cnf(a0, assumption,
% 11.15/1.96 sK90 = sK90).
% 11.15/1.96 cnf(a1, assumption,
% 11.15/1.96 sK88 = X1).
% 11.15/1.96 cnf(c3, plain,
% 11.15/1.96 $false,
% 11.15/1.96 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 11.15/1.96 cnf(c4, plain,
% 11.15/1.96 ~memberP(sK91,X0) | ~ssItem(X0),
% 11.15/1.96 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 11.15/1.96 cnf(c5, plain,
% 11.15/1.96 memberP(X1,X0),
% 11.15/1.96 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 11.15/1.96
% 11.15/1.96 cnf(c6, axiom,
% 11.15/1.96 ~memberP(sK88,sK92)).
% 11.15/1.96 cnf(a2, assumption,
% 11.15/1.96 X1 = sK88).
% 11.15/1.96 cnf(a3, assumption,
% 11.15/1.96 X0 = sK92).
% 11.15/1.96 cnf(c7, plain,
% 11.15/1.96 $false,
% 11.15/1.96 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 11.15/1.96 cnf(c8, plain,
% 11.15/1.96 $false,
% 11.15/1.96 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 11.15/1.96
% 11.15/1.96 cnf(c9, axiom,
% 11.15/1.96 sK89 = sK91).
% 11.15/1.96 cnf(a4, assumption,
% 11.15/1.96 sK91 = sK91).
% 11.15/1.96 cnf(c10, plain,
% 11.15/1.96 ~ssItem(X0),
% 11.15/1.96 inference(strict_function_extension, [assumptions([a4])], [c4, c9])).
% 11.15/1.96 cnf(c11, plain,
% 11.15/1.96 $false,
% 11.15/1.96 inference(strict_function_extension, [assumptions([a4])], [c4, c9])).
% 11.15/1.96 cnf(c12, plain,
% 11.15/1.96 X2 != sK89 | ~memberP(X2,X0),
% 11.15/1.96 inference(strict_function_extension, [assumptions([a4])], [c4, c9])).
% 11.15/1.96
% 11.15/1.96 cnf(a5, assumption,
% 11.15/1.96 X2 = sK89).
% 11.15/1.96 cnf(c13, plain,
% 11.15/1.96 ~memberP(X2,X0),
% 11.15/1.96 inference(reflexivity, [assumptions([a5])], [c12])).
% 11.15/1.96
% 11.15/1.96 cnf(c14, axiom,
% 11.15/1.96 memberP(sK89,sK92)).
% 11.15/1.96 cnf(a6, assumption,
% 11.15/1.96 X2 = sK89).
% 11.15/1.96 cnf(a7, assumption,
% 11.15/1.96 X0 = sK92).
% 11.15/1.96 cnf(c15, plain,
% 11.15/1.96 $false,
% 11.15/1.96 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c14])).
% 11.15/1.96 cnf(c16, plain,
% 11.15/1.96 $false,
% 11.15/1.96 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c14])).
% 11.15/1.96
% 11.15/1.96 cnf(c17, axiom,
% 11.15/1.96 ssItem(sK92)).
% 11.15/1.96 cnf(a8, assumption,
% 11.15/1.96 X0 = sK92).
% 11.15/1.96 cnf(c18, plain,
% 11.15/1.96 $false,
% 11.15/1.96 inference(strict_predicate_extension, [assumptions([a8])], [c10, c17])).
% 11.15/1.96 cnf(c19, plain,
% 11.15/1.96 $false,
% 11.15/1.96 inference(strict_predicate_extension, [assumptions([a8])], [c10, c17])).
% 11.15/1.96
% 11.15/1.96 cnf(c20, plain,
% 11.15/1.96 $false,
% 11.15/1.96 inference(constraint_solving, [
% 11.15/1.96 bind(X0, sK92),
% 11.15/1.96 bind(X1, sK88),
% 11.15/1.96 bind(X2, sK89)
% 11.15/1.96 ],
% 11.15/1.96 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 11.15/1.96
% 11.15/1.96 % SZS output end IncompleteProof
%------------------------------------------------------------------------------