%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWC133+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 : n010.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:18 EDT 2022 % Result : Theorem 19.36s 2.99s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWC133+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 : n010.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 : Sun Jun 12 16:03:40 EDT 2022 % 0.14/0.34 % CPUTime : % 19.36/2.99 % SZS status Theorem % 19.36/2.99 % SZS output begin IncompleteProof % 19.36/2.99 cnf(c0, axiom, % 19.36/2.99 sK89 = sK91). % 19.36/2.99 cnf(c1, plain, % 19.36/2.99 sK89 = sK91, % 19.36/2.99 inference(start, [], [c0])). % 19.36/2.99 % 19.36/2.99 cnf(c2, axiom, % 19.36/2.99 ~neq(sK91,nil)). % 19.36/2.99 cnf(a0, assumption, % 19.36/2.99 sK91 = sK91). % 19.36/2.99 cnf(a1, assumption, % 19.36/2.99 sK89 = X0). % 19.36/2.99 cnf(c3, plain, % 19.36/2.99 $false, % 19.36/2.99 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 19.36/2.99 cnf(c4, plain, % 19.36/2.99 $false, % 19.36/2.99 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 19.36/2.99 cnf(c5, plain, % 19.36/2.99 ~neq(X0,nil), % 19.36/2.99 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 19.36/2.99 % 19.36/2.99 cnf(c6, axiom, % 19.36/2.99 neq(X1,X2) | X1 = X2 | ~ssList(X2) | ~ssList(X1)). % 19.36/2.99 cnf(a2, assumption, % 19.36/2.99 X0 = X1). % 19.36/2.99 cnf(a3, assumption, % 19.36/2.99 nil = X2). % 19.36/2.99 cnf(c7, plain, % 19.36/2.99 $false, % 19.36/2.99 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 19.36/2.99 cnf(c8, plain, % 19.36/2.99 X1 = X2 | ~ssList(X2) | ~ssList(X1), % 19.36/2.99 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 19.36/2.99 % 19.36/2.99 cnf(c9, axiom, % 19.36/2.99 ~cyclefreeP(sK89)). % 19.36/2.99 cnf(a4, assumption, % 19.36/2.99 sK89 = X1). % 19.36/2.99 cnf(c10, plain, % 19.36/2.99 ~ssList(X2) | ~ssList(X1), % 19.36/2.99 inference(strict_subterm_extension, [assumptions([a4])], [c8, c9])). % 19.36/2.99 cnf(c11, plain, % 19.36/2.99 $false, % 19.36/2.99 inference(strict_subterm_extension, [assumptions([a4])], [c8, c9])). % 19.36/2.99 cnf(c12, plain, % 19.36/2.99 ~cyclefreeP(X2), % 19.36/2.99 inference(strict_subterm_extension, [assumptions([a4])], [c8, c9])). % 19.36/2.99 % 19.36/2.99 cnf(c13, axiom, % 19.36/2.99 cyclefreeP(nil)). % 19.36/2.99 cnf(a5, assumption, % 19.36/2.99 X2 = nil). % 19.36/2.99 cnf(c14, plain, % 19.36/2.99 $false, % 19.36/2.99 inference(strict_predicate_extension, [assumptions([a5])], [c12, c13])). % 19.36/2.99 cnf(c15, plain, % 19.36/2.99 $false, % 19.36/2.99 inference(strict_predicate_extension, [assumptions([a5])], [c12, c13])). % 19.36/2.99 % 19.36/2.99 cnf(c16, axiom, % 19.36/2.99 ssList(nil)). % 19.36/2.99 cnf(a6, assumption, % 19.36/2.99 X2 = nil). % 19.36/2.99 cnf(c17, plain, % 19.36/2.99 ~ssList(X1), % 19.36/2.99 inference(strict_predicate_extension, [assumptions([a6])], [c10, c16])). % 19.36/2.99 cnf(c18, plain, % 19.36/2.99 $false, % 19.36/2.99 inference(strict_predicate_extension, [assumptions([a6])], [c10, c16])). % 19.36/2.99 % 19.36/2.99 cnf(c19, axiom, % 19.36/2.99 ssList(sK89)). % 19.36/2.99 cnf(a7, assumption, % 19.36/2.99 X1 = sK89). % 19.36/2.99 cnf(c20, plain, % 19.36/2.99 $false, % 19.36/2.99 inference(strict_predicate_extension, [assumptions([a7])], [c17, c19])). % 19.36/2.99 cnf(c21, plain, % 19.36/2.99 $false, % 19.36/2.99 inference(strict_predicate_extension, [assumptions([a7])], [c17, c19])). % 19.36/2.99 % 19.36/2.99 cnf(c22, plain, % 19.36/2.99 $false, % 19.36/2.99 inference(constraint_solving, [ % 19.36/2.99 bind(X0, sK89), % 19.36/2.99 bind(X1, sK89), % 19.36/2.99 bind(X2, nil) % 19.36/2.99 ], % 19.36/2.99 [a0, a1, a2, a3, a4, a5, a6, a7])). % 19.36/2.99 % 19.36/2.99 % SZS output end IncompleteProof %------------------------------------------------------------------------------