%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL169-1 : TPTP v9.3.1. Released v1.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 : n002.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 12:28:13 PM UTC 2026 % Result : Unsatisfiable 0.10s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL169-1 : TPTP v9.3.1. Released v1.1.0. % 0.00/0.03 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.10/0.36 % Computer : n002.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Sun Sep 6 02:03:21 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.38 % SZS status Unsatisfiable % 0.10/0.38 % SZS output begin IncompleteProof % 0.10/0.38 cnf(c0, axiom, % 0.10/0.38 ~theorem(or(not(or(not(p),not(p))),not(p)))). % 0.10/0.38 cnf(c1, plain, % 0.10/0.38 ~theorem(or(not(or(not(p),not(p))),not(p))), % 0.10/0.38 inference(start, [], [c0])). % 0.10/0.38 % 0.10/0.38 cnf(c2, axiom, % 0.10/0.38 ~axiom(X0) | theorem(X0)). % 0.10/0.38 cnf(a0, assumption, % 0.10/0.38 or(not(or(not(p),not(p))),not(p)) = X0). % 0.10/0.38 cnf(c3, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.38 cnf(c4, plain, % 0.10/0.38 ~axiom(X0), % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.10/0.38 % 0.10/0.38 cnf(c5, axiom, % 0.10/0.38 axiom(or(not(or(X1,X1)),X1))). % 0.10/0.38 cnf(a1, assumption, % 0.10/0.38 X0 = or(not(or(X1,X1)),X1)). % 0.10/0.38 cnf(c6, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.10/0.38 cnf(c7, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.10/0.38 % 0.10/0.38 cnf(c8, plain, % 0.10/0.38 $false, % 0.10/0.38 inference(constraint_solving, [ % 0.10/0.38 bind(X0, or(not(or(not(p),not(p))),not(p))), % 0.10/0.38 bind(X1, not(p)) % 0.10/0.38 ], % 0.10/0.38 [a0, a1])). % 0.10/0.38 % 0.10/0.38 % SZS output end IncompleteProof %------------------------------------------------------------------------------