%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWC102-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 : n029.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:07:08 EDT 2022 % Result : Unsatisfiable 29.64s 4.32s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWC102-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.14/0.34 % Computer : n029.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Sat Jun 11 20:44:23 EDT 2022 % 0.14/0.34 % CPUTime : % 29.64/4.32 % SZS status Unsatisfiable % 29.64/4.32 % SZS output begin IncompleteProof % 29.64/4.32 cnf(c0, axiom, % 29.64/4.32 sk3 = sk4). % 29.64/4.32 cnf(c1, plain, % 29.64/4.32 sk3 = sk4, % 29.64/4.32 inference(start, [], [c0])). % 29.64/4.32 % 29.64/4.32 cnf(c2, axiom, % 29.64/4.32 sk2 = sk4). % 29.64/4.32 cnf(a0, assumption, % 29.64/4.32 sk4 = sk4). % 29.64/4.32 cnf(a1, assumption, % 29.64/4.32 sk3 = X0). % 29.64/4.32 cnf(c3, plain, % 29.64/4.32 $false, % 29.64/4.32 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 29.64/4.32 cnf(c4, plain, % 29.64/4.32 $false, % 29.64/4.32 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 29.64/4.32 cnf(c5, plain, % 29.64/4.32 sk2 = X0, % 29.64/4.32 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 29.64/4.32 % 29.64/4.32 cnf(c6, axiom, % 29.64/4.32 sk1 = sk3). % 29.64/4.32 cnf(a2, assumption, % 29.64/4.32 sk3 = X0). % 29.64/4.32 cnf(a3, assumption, % 29.64/4.32 sk2 = X1). % 29.64/4.32 cnf(c7, plain, % 29.64/4.32 $false, % 29.64/4.32 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])). % 29.64/4.32 cnf(c8, plain, % 29.64/4.32 $false, % 29.64/4.32 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])). % 29.64/4.32 cnf(c9, plain, % 29.64/4.32 sk1 = X1, % 29.64/4.32 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])). % 29.64/4.32 % 29.64/4.32 cnf(c10, axiom, % 29.64/4.32 neq(sk2,nil)). % 29.64/4.32 cnf(a4, assumption, % 29.64/4.32 sk2 = X1). % 29.64/4.32 cnf(a5, assumption, % 29.64/4.32 sk1 = X2). % 29.64/4.32 cnf(c11, plain, % 29.64/4.32 $false, % 29.64/4.32 inference(strict_subterm_extension, [assumptions([a4, a5])], [c9, c10])). % 29.64/4.32 cnf(c12, plain, % 29.64/4.32 $false, % 29.64/4.32 inference(strict_subterm_extension, [assumptions([a4, a5])], [c9, c10])). % 29.64/4.32 cnf(c13, plain, % 29.64/4.32 neq(X2,nil), % 29.64/4.32 inference(strict_subterm_extension, [assumptions([a4, a5])], [c9, c10])). % 29.64/4.32 % 29.64/4.32 cnf(c14, axiom, % 29.64/4.32 ~frontsegP(sk2,sk1) | ~neq(sk1,nil)). % 29.64/4.32 cnf(a6, assumption, % 29.64/4.32 X2 = sk1). % 29.64/4.32 cnf(a7, assumption, % 29.64/4.32 nil = nil). % 29.64/4.32 cnf(c15, plain, % 29.64/4.32 $false, % 29.64/4.32 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c14])). % 29.64/4.32 cnf(c16, plain, % 29.64/4.32 ~frontsegP(sk2,sk1), % 29.64/4.32 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c14])). % 29.64/4.32 % 29.64/4.32 cnf(c17, plain, % 29.64/4.32 sk1 = X1). % 29.64/4.32 cnf(a8, assumption, % 29.64/4.32 sk2 = X1). % 29.64/4.32 cnf(a9, assumption, % 29.64/4.32 sk1 = X3). % 29.64/4.32 cnf(c18, plain, % 29.64/4.32 $false, % 29.64/4.32 inference(equality_reduction, [assumptions([a8, a9])], [c16, c17])). % 29.64/4.32 cnf(c19, plain, % 29.64/4.32 ~frontsegP(X3,sk1), % 29.64/4.32 inference(equality_reduction, [assumptions([a8, a9])], [c16, c17])). % 29.64/4.32 % 29.64/4.32 cnf(c20, axiom, % 29.64/4.32 frontsegP(X4,X4) | ~ssList(X4)). % 29.64/4.32 cnf(a10, assumption, % 29.64/4.32 X3 = X4). % 29.64/4.32 cnf(a11, assumption, % 29.64/4.32 sk1 = X4). % 29.64/4.32 cnf(c21, plain, % 29.64/4.32 $false, % 29.64/4.32 inference(strict_predicate_extension, [assumptions([a10, a11])], [c19, c20])). % 29.64/4.32 cnf(c22, plain, % 29.64/4.32 ~ssList(X4), % 29.64/4.32 inference(strict_predicate_extension, [assumptions([a10, a11])], [c19, c20])). % 29.64/4.32 % 29.64/4.32 cnf(c23, axiom, % 29.64/4.32 ssList(sk1)). % 29.64/4.32 cnf(a12, assumption, % 29.64/4.32 X4 = sk1). % 29.64/4.32 cnf(c24, plain, % 29.64/4.32 $false, % 29.64/4.32 inference(strict_predicate_extension, [assumptions([a12])], [c22, c23])). % 29.64/4.32 cnf(c25, plain, % 29.64/4.32 $false, % 29.64/4.32 inference(strict_predicate_extension, [assumptions([a12])], [c22, c23])). % 29.64/4.32 % 29.64/4.32 cnf(c26, plain, % 29.64/4.32 $false, % 29.64/4.32 inference(constraint_solving, [ % 29.64/4.32 bind(X0, sk3), % 29.64/4.32 bind(X1, sk2), % 29.64/4.32 bind(X2, sk1), % 29.64/4.32 bind(X3, sk1), % 29.64/4.32 bind(X4, sk1) % 29.64/4.32 ], % 29.64/4.32 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 29.64/4.32 % 29.64/4.32 % SZS output end IncompleteProof %------------------------------------------------------------------------------