%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n025.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 : Fri Jul 15 20:38:06 EDT 2022 % Result : Theorem 0.13s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n025.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Fri Jun 10 07:07:21 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.35 % SZS status Theorem % 0.13/0.35 % SZS output begin IncompleteProof % 0.13/0.35 cnf(c0, axiom, % 0.13/0.35 ~s__more_experienced(jim,geoff)). % 0.13/0.35 cnf(c1, plain, % 0.13/0.35 ~s__more_experienced(jim,geoff), % 0.13/0.35 inference(start, [], [c0])). % 0.13/0.35 % 0.13/0.35 cnf(c2, axiom, % 0.13/0.35 s__has_seen_more(s__siblingFn(X0),X0) | s__more_experienced(X0,s__siblingFn(X0)) | ~greater(X1,X2) | ~s__age(s__siblingFn(X0),X2) | ~s__age(X0,X1) | ~s__Human(X0)). % 0.13/0.35 cnf(a0, assumption, % 0.13/0.35 X3 = jim). % 0.13/0.35 cnf(a1, assumption, % 0.13/0.35 X4 = geoff). % 0.13/0.35 cnf(c3, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.35 cnf(c4, plain, % 0.13/0.35 s__has_seen_more(s__siblingFn(X0),X0) | ~greater(X1,X2) | ~s__age(s__siblingFn(X0),X2) | ~s__age(X0,X1) | ~s__Human(X0), % 0.13/0.35 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.35 cnf(c5, plain, % 0.13/0.35 X0 != X3 | s__siblingFn(X0) != X4, % 0.13/0.35 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.35 % 0.13/0.35 cnf(a2, assumption, % 0.13/0.35 X0 = X3). % 0.13/0.35 cnf(c6, plain, % 0.13/0.35 s__siblingFn(X0) != X4, % 0.13/0.35 inference(reflexivity, [assumptions([a2])], [c5])). % 0.13/0.35 % 0.13/0.35 cnf(c7, axiom, % 0.13/0.35 geoff = s__siblingFn(jim)). % 0.13/0.35 cnf(a3, assumption, % 0.13/0.35 s__siblingFn(X0) = s__siblingFn(jim)). % 0.13/0.35 cnf(c8, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_function_extension, [assumptions([a3])], [c6, c7])). % 0.13/0.35 cnf(c9, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_function_extension, [assumptions([a3])], [c6, c7])). % 0.13/0.35 cnf(c10, plain, % 0.13/0.35 X5 != geoff | X5 != X4, % 0.13/0.35 inference(strict_function_extension, [assumptions([a3])], [c6, c7])). % 0.13/0.35 % 0.13/0.35 cnf(a4, assumption, % 0.13/0.35 X5 = geoff). % 0.13/0.35 cnf(c11, plain, % 0.13/0.35 X5 != X4, % 0.13/0.35 inference(reflexivity, [assumptions([a4])], [c10])). % 0.13/0.35 % 0.13/0.35 cnf(a5, assumption, % 0.13/0.35 X5 = X4). % 0.13/0.35 cnf(c12, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(reflexivity, [assumptions([a5])], [c11])). % 0.13/0.35 % 0.13/0.35 cnf(c13, plain, % 0.13/0.35 s__siblingFn(X0) = X4). % 0.13/0.35 cnf(a6, assumption, % 0.13/0.35 s__siblingFn(X0) = s__siblingFn(X0)). % 0.13/0.35 cnf(c14, plain, % 0.13/0.35 ~greater(X1,X2) | ~s__age(s__siblingFn(X0),X2) | ~s__age(X0,X1) | ~s__Human(X0), % 0.13/0.35 inference(equality_reduction, [assumptions([a6])], [c4, c13])). % 0.13/0.35 cnf(c15, plain, % 0.13/0.35 s__has_seen_more(X4,X0), % 0.13/0.35 inference(equality_reduction, [assumptions([a6])], [c4, c13])). % 0.13/0.35 % 0.13/0.35 cnf(c16, axiom, % 0.13/0.35 ~s__has_seen_more(geoff,jim)). % 0.13/0.35 cnf(a7, assumption, % 0.13/0.35 X4 = geoff). % 0.13/0.35 cnf(a8, assumption, % 0.13/0.35 X0 = jim). % 0.13/0.35 cnf(c17, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a7, a8])], [c15, c16])). % 0.13/0.35 cnf(c18, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a7, a8])], [c15, c16])). % 0.13/0.35 % 0.13/0.35 cnf(c19, axiom, % 0.13/0.35 greater(n54,n48)). % 0.13/0.35 cnf(a9, assumption, % 0.13/0.35 X1 = n54). % 0.13/0.35 cnf(a10, assumption, % 0.13/0.35 X2 = n48). % 0.13/0.35 cnf(c20, plain, % 0.13/0.35 ~s__age(s__siblingFn(X0),X2) | ~s__age(X0,X1) | ~s__Human(X0), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c19])). % 0.13/0.35 cnf(c21, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a9, a10])], [c14, c19])). % 0.13/0.35 % 0.13/0.35 cnf(c22, plain, % 0.13/0.35 s__siblingFn(X0) = X4). % 0.13/0.35 cnf(a11, assumption, % 0.13/0.35 s__siblingFn(X0) = s__siblingFn(X0)). % 0.13/0.35 cnf(c23, plain, % 0.13/0.35 ~s__age(X0,X1) | ~s__Human(X0), % 0.13/0.35 inference(equality_reduction, [assumptions([a11])], [c20, c22])). % 0.13/0.35 cnf(c24, plain, % 0.13/0.35 ~s__age(X4,X2), % 0.13/0.35 inference(equality_reduction, [assumptions([a11])], [c20, c22])). % 0.13/0.35 % 0.13/0.35 cnf(c25, axiom, % 0.13/0.35 s__age(geoff,n48)). % 0.13/0.35 cnf(a12, assumption, % 0.13/0.35 X4 = geoff). % 0.13/0.35 cnf(a13, assumption, % 0.13/0.35 X2 = n48). % 0.13/0.35 cnf(c26, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a12, a13])], [c24, c25])). % 0.13/0.35 cnf(c27, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a12, a13])], [c24, c25])). % 0.13/0.35 % 0.13/0.35 cnf(c28, axiom, % 0.13/0.35 s__age(jim,n54)). % 0.13/0.35 cnf(a14, assumption, % 0.13/0.35 X0 = jim). % 0.13/0.35 cnf(a15, assumption, % 0.13/0.35 X1 = n54). % 0.13/0.35 cnf(c29, plain, % 0.13/0.35 ~s__Human(X0), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a14, a15])], [c23, c28])). % 0.13/0.35 cnf(c30, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a14, a15])], [c23, c28])). % 0.13/0.35 % 0.13/0.35 cnf(c31, axiom, % 0.13/0.35 s__Human(jim)). % 0.13/0.35 cnf(a16, assumption, % 0.13/0.35 X0 = jim). % 0.13/0.35 cnf(c32, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a16])], [c29, c31])). % 0.13/0.35 cnf(c33, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a16])], [c29, c31])). % 0.13/0.35 % 0.13/0.35 cnf(c34, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(constraint_solving, [ % 0.13/0.35 bind(X0, jim), % 0.13/0.35 bind(X1, n54), % 0.13/0.35 bind(X2, n48), % 0.13/0.35 bind(X3, jim), % 0.13/0.35 bind(X4, geoff), % 0.13/0.35 bind(X5, geoff) % 0.13/0.35 ], % 0.13/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])). % 0.13/0.35 % 0.13/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------