%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWC349+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 : n027.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:22 EDT 2022 % Result : Theorem 0.20s 0.44s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SWC349+1 : TPTP v8.1.0. Released v2.4.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n027.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 : Sun Jun 12 22:47:31 EDT 2022 % 0.12/0.33 % CPUTime : % 0.20/0.44 % SZS status Theorem % 0.20/0.44 % SZS output begin IncompleteProof % 0.20/0.44 cnf(c0, axiom, % 0.20/0.44 sK88 = sK90). % 0.20/0.44 cnf(c1, plain, % 0.20/0.44 sK88 = sK90, % 0.20/0.44 inference(start, [], [c0])). % 0.20/0.44 % 0.20/0.44 cnf(c2, axiom, % 0.20/0.44 nil = sK90). % 0.20/0.44 cnf(a0, assumption, % 0.20/0.44 sK90 = sK90). % 0.20/0.44 cnf(a1, assumption, % 0.20/0.44 sK88 = X0). % 0.20/0.44 cnf(c3, plain, % 0.20/0.44 $false, % 0.20/0.44 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.44 cnf(c4, plain, % 0.20/0.44 $false, % 0.20/0.44 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.44 cnf(c5, plain, % 0.20/0.44 nil = X0, % 0.20/0.44 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.44 % 0.20/0.44 cnf(c6, axiom, % 0.20/0.44 ~frontsegP(sK89,sK88)). % 0.20/0.44 cnf(a2, assumption, % 0.20/0.44 sK88 = X0). % 0.20/0.44 cnf(a3, assumption, % 0.20/0.44 nil = X1). % 0.20/0.44 cnf(c7, plain, % 0.20/0.44 $false, % 0.20/0.44 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])). % 0.20/0.44 cnf(c8, plain, % 0.20/0.44 $false, % 0.20/0.44 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])). % 0.20/0.44 cnf(c9, plain, % 0.20/0.44 ~frontsegP(sK89,X1), % 0.20/0.44 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])). % 0.20/0.44 % 0.20/0.44 cnf(c10, axiom, % 0.20/0.44 frontsegP(X2,nil) | ~ssList(X2)). % 0.20/0.44 cnf(a4, assumption, % 0.20/0.45 sK89 = X2). % 0.20/0.45 cnf(a5, assumption, % 0.20/0.45 X1 = nil). % 0.20/0.45 cnf(c11, plain, % 0.20/0.45 $false, % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c10])). % 0.20/0.45 cnf(c12, plain, % 0.20/0.45 ~ssList(X2), % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c10])). % 0.20/0.45 % 0.20/0.45 cnf(c13, axiom, % 0.20/0.45 ssList(sK89)). % 0.20/0.45 cnf(a6, assumption, % 0.20/0.45 X2 = sK89). % 0.20/0.45 cnf(c14, plain, % 0.20/0.45 $false, % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a6])], [c12, c13])). % 0.20/0.45 cnf(c15, plain, % 0.20/0.45 $false, % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a6])], [c12, c13])). % 0.20/0.45 % 0.20/0.45 cnf(c16, plain, % 0.20/0.45 $false, % 0.20/0.45 inference(constraint_solving, [ % 0.20/0.45 bind(X0, sK88), % 0.20/0.45 bind(X1, nil), % 0.20/0.45 bind(X2, sK89) % 0.20/0.45 ], % 0.20/0.45 [a0, a1, a2, a3, a4, a5, a6])). % 0.20/0.45 % 0.20/0.45 % SZS output end IncompleteProof %------------------------------------------------------------------------------