%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWC130-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 : n028.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:17 EDT 2022 % Result : Unsatisfiable 12.01s 2.01s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWC130-1 : TPTP v8.1.0. Released v2.4.0. % 0.06/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n028.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sun Jun 12 03:54:36 EDT 2022 % 0.13/0.33 % CPUTime : % 12.01/2.01 % SZS status Unsatisfiable % 12.01/2.01 % SZS output begin IncompleteProof % 12.01/2.01 cnf(c0, axiom, % 12.01/2.01 sk2 = sk4). % 12.01/2.01 cnf(c1, plain, % 12.01/2.01 sk2 = sk4, % 12.01/2.01 inference(start, [], [c0])). % 12.01/2.01 % 12.01/2.01 cnf(c2, axiom, % 12.01/2.01 ~neq(sk4,nil)). % 12.01/2.01 cnf(a0, assumption, % 12.01/2.01 sk4 = sk4). % 12.01/2.01 cnf(a1, assumption, % 12.01/2.01 sk2 = X0). % 12.01/2.01 cnf(c3, plain, % 12.01/2.01 $false, % 12.01/2.01 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 12.01/2.01 cnf(c4, plain, % 12.01/2.01 $false, % 12.01/2.01 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 12.01/2.01 cnf(c5, plain, % 12.01/2.01 ~neq(X0,nil), % 12.01/2.01 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 12.01/2.01 % 12.01/2.01 cnf(c6, axiom, % 12.01/2.01 X1 = X2 | neq(X2,X1) | ~ssList(X2) | ~ssList(X1)). % 12.01/2.01 cnf(a2, assumption, % 12.01/2.01 X0 = X2). % 12.01/2.01 cnf(a3, assumption, % 12.01/2.01 nil = X1). % 12.01/2.01 cnf(c7, plain, % 12.01/2.01 $false, % 12.01/2.01 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 12.01/2.01 cnf(c8, plain, % 12.01/2.01 X1 = X2 | ~ssList(X2) | ~ssList(X1), % 12.01/2.01 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 12.01/2.01 % 12.01/2.01 cnf(c9, axiom, % 12.01/2.01 ~cyclefreeP(sk2)). % 12.01/2.01 cnf(a4, assumption, % 12.01/2.01 sk2 = X2). % 12.01/2.01 cnf(c10, plain, % 12.01/2.01 ~ssList(X2) | ~ssList(X1), % 12.01/2.01 inference(strict_subterm_extension, [assumptions([a4])], [c8, c9])). % 12.01/2.01 cnf(c11, plain, % 12.01/2.01 $false, % 12.01/2.01 inference(strict_subterm_extension, [assumptions([a4])], [c8, c9])). % 12.01/2.01 cnf(c12, plain, % 12.01/2.01 ~cyclefreeP(X1), % 12.01/2.01 inference(strict_subterm_extension, [assumptions([a4])], [c8, c9])). % 12.01/2.01 % 12.01/2.01 cnf(c13, axiom, % 12.01/2.01 cyclefreeP(nil)). % 12.01/2.01 cnf(a5, assumption, % 12.01/2.01 X1 = nil). % 12.01/2.01 cnf(c14, plain, % 12.01/2.01 $false, % 12.01/2.01 inference(strict_predicate_extension, [assumptions([a5])], [c12, c13])). % 12.01/2.01 cnf(c15, plain, % 12.01/2.01 $false, % 12.01/2.01 inference(strict_predicate_extension, [assumptions([a5])], [c12, c13])). % 12.01/2.01 % 12.01/2.01 cnf(c16, axiom, % 12.01/2.01 ssList(sk2)). % 12.01/2.01 cnf(a6, assumption, % 12.01/2.01 X2 = sk2). % 12.01/2.01 cnf(c17, plain, % 12.01/2.01 ~ssList(X1), % 12.01/2.01 inference(strict_predicate_extension, [assumptions([a6])], [c10, c16])). % 12.01/2.01 cnf(c18, plain, % 12.01/2.01 $false, % 12.01/2.01 inference(strict_predicate_extension, [assumptions([a6])], [c10, c16])). % 12.01/2.01 % 12.01/2.01 cnf(c19, axiom, % 12.01/2.01 ssList(nil)). % 12.01/2.01 cnf(a7, assumption, % 12.01/2.01 X1 = nil). % 12.01/2.01 cnf(c20, plain, % 12.01/2.01 $false, % 12.01/2.01 inference(strict_predicate_extension, [assumptions([a7])], [c17, c19])). % 12.01/2.01 cnf(c21, plain, % 12.01/2.01 $false, % 12.01/2.01 inference(strict_predicate_extension, [assumptions([a7])], [c17, c19])). % 12.01/2.01 % 12.01/2.01 cnf(c22, plain, % 12.01/2.01 $false, % 12.01/2.01 inference(constraint_solving, [ % 12.01/2.01 bind(X0, sk2), % 12.01/2.01 bind(X1, nil), % 12.01/2.01 bind(X2, sk2) % 12.01/2.01 ], % 12.01/2.01 [a0, a1, a2, a3, a4, a5, a6, a7])). % 12.01/2.01 % 12.01/2.01 % SZS output end IncompleteProof %------------------------------------------------------------------------------