%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWC367-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 : n009.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:28 EDT 2022 % Result : Unsatisfiable 25.46s 3.78s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWC367-1 : TPTP v8.1.0. Released v2.4.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n009.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 09:05:08 EDT 2022 % 0.12/0.34 % CPUTime : % 25.46/3.78 % SZS status Unsatisfiable % 25.46/3.78 % SZS output begin IncompleteProof % 25.46/3.78 cnf(c0, axiom, % 25.46/3.78 sk1 = sk3). % 25.46/3.78 cnf(c1, plain, % 25.46/3.78 sk1 = sk3, % 25.46/3.78 inference(start, [], [c0])). % 25.46/3.78 % 25.46/3.78 cnf(c2, axiom, % 25.46/3.78 rearsegP(sk4,sk3) | nil = sk3). % 25.46/3.78 cnf(a0, assumption, % 25.46/3.78 sk3 = sk3). % 25.46/3.78 cnf(a1, assumption, % 25.46/3.78 sk1 = X0). % 25.46/3.78 cnf(c3, plain, % 25.46/3.78 $false, % 25.46/3.78 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 25.46/3.78 cnf(c4, plain, % 25.46/3.78 nil = sk3, % 25.46/3.78 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 25.46/3.78 cnf(c5, plain, % 25.46/3.78 rearsegP(sk4,X0), % 25.46/3.78 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 25.46/3.78 % 25.46/3.78 cnf(c6, axiom, % 25.46/3.78 sk2 = sk4). % 25.46/3.78 cnf(a2, assumption, % 25.46/3.78 sk4 = sk4). % 25.46/3.78 cnf(c7, plain, % 25.46/3.78 $false, % 25.46/3.78 inference(strict_function_extension, [assumptions([a2])], [c5, c6])). % 25.46/3.78 cnf(c8, plain, % 25.46/3.78 $false, % 25.46/3.78 inference(strict_function_extension, [assumptions([a2])], [c5, c6])). % 25.46/3.78 cnf(c9, plain, % 25.46/3.78 X1 != sk2 | rearsegP(X1,X0), % 25.46/3.78 inference(strict_function_extension, [assumptions([a2])], [c5, c6])). % 25.46/3.78 % 25.46/3.78 cnf(a3, assumption, % 25.46/3.78 X1 = sk2). % 25.46/3.78 cnf(c10, plain, % 25.46/3.78 rearsegP(X1,X0), % 25.46/3.78 inference(reflexivity, [assumptions([a3])], [c9])). % 25.46/3.78 % 25.46/3.78 cnf(c11, axiom, % 25.46/3.78 ~rearsegP(sk2,sk1)). % 25.46/3.78 cnf(a4, assumption, % 25.46/3.78 X1 = sk2). % 25.46/3.78 cnf(a5, assumption, % 25.46/3.78 X0 = sk1). % 25.46/3.78 cnf(c12, plain, % 25.46/3.78 $false, % 25.46/3.78 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])). % 25.46/3.78 cnf(c13, plain, % 25.46/3.78 $false, % 25.46/3.78 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])). % 25.46/3.78 % 25.46/3.78 cnf(c14, plain, % 25.46/3.78 ~rearsegP(sk4,sk3)). % 25.46/3.78 cnf(a6, assumption, % 25.46/3.78 sk3 = sk3). % 25.46/3.78 cnf(a7, assumption, % 25.46/3.78 nil = X2). % 25.46/3.78 cnf(c15, plain, % 25.46/3.78 $false, % 25.46/3.78 inference(subterm_reduction, [assumptions([a6, a7])], [c4, c14])). % 25.46/3.78 cnf(c16, plain, % 25.46/3.78 ~rearsegP(sk4,X2), % 25.46/3.78 inference(subterm_reduction, [assumptions([a6, a7])], [c4, c14])). % 25.46/3.78 % 25.46/3.78 cnf(c17, axiom, % 25.46/3.78 rearsegP(X3,nil) | ~ssList(X3)). % 25.46/3.78 cnf(a8, assumption, % 25.46/3.78 sk4 = X3). % 25.46/3.78 cnf(a9, assumption, % 25.46/3.78 X2 = nil). % 25.46/3.78 cnf(c18, plain, % 25.46/3.78 $false, % 25.46/3.78 inference(strict_predicate_extension, [assumptions([a8, a9])], [c16, c17])). % 25.46/3.78 cnf(c19, plain, % 25.46/3.78 ~ssList(X3), % 25.46/3.78 inference(strict_predicate_extension, [assumptions([a8, a9])], [c16, c17])). % 25.46/3.78 % 25.46/3.78 cnf(c20, axiom, % 25.46/3.78 ssList(sk4)). % 25.46/3.78 cnf(a10, assumption, % 25.46/3.78 X3 = sk4). % 25.46/3.78 cnf(c21, plain, % 25.46/3.78 $false, % 25.46/3.78 inference(strict_predicate_extension, [assumptions([a10])], [c19, c20])). % 25.46/3.78 cnf(c22, plain, % 25.46/3.78 $false, % 25.46/3.78 inference(strict_predicate_extension, [assumptions([a10])], [c19, c20])). % 25.46/3.78 % 25.46/3.78 cnf(c23, plain, % 25.46/3.78 $false, % 25.46/3.78 inference(constraint_solving, [ % 25.46/3.78 bind(X0, sk1), % 25.46/3.78 bind(X1, sk2), % 25.46/3.78 bind(X2, nil), % 25.46/3.78 bind(X3, sk4) % 25.46/3.78 ], % 25.46/3.78 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 25.46/3.78 % 25.46/3.78 % SZS output end IncompleteProof %------------------------------------------------------------------------------