%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL013-1 : TPTP v9.3.1. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n027.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:02 PM UTC 2026 % Result : Unsatisfiable 0.13s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL013-1 : TPTP v9.3.1. Released v1.0.0. % 0.00/0.03 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.09/0.34 % Computer : n027.cluster.edu % 0.09/0.34 % Model : x86_64 x86_64 % 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.34 % Memory : 8046.5625MB % 0.09/0.34 % OS : Linux 6.8.0-71-generic % 0.09/0.34 % CPULimit : 300 % 0.09/0.34 % WCLimit : 300 % 0.09/0.34 % DateTime : Fri Sep 4 14:02:42 UTC 2026 % 0.09/0.35 % CPUTime : % 0.13/0.35 % SZS status Unsatisfiable % 0.13/0.35 % SZS output begin IncompleteProof % 0.13/0.35 cnf(c0, axiom, % 0.13/0.35 ~is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a))))). % 0.13/0.35 cnf(c1, plain, % 0.13/0.35 ~is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))), % 0.13/0.35 inference(start, [], [c0])). % 0.13/0.35 % 0.13/0.35 cnf(c2, axiom, % 0.13/0.35 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(equivalent(X1,X0))). % 0.13/0.35 cnf(a0, assumption, % 0.13/0.35 equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a))) = X0). % 0.13/0.35 cnf(c3, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.35 cnf(c4, plain, % 0.13/0.35 ~is_a_theorem(X1) | ~is_a_theorem(equivalent(X1,X0)), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.35 % 0.13/0.35 cnf(c5, axiom, % 0.13/0.35 is_a_theorem(equivalent(X2,equivalent(equivalent(X3,equivalent(X2,X4)),equivalent(X4,X3))))). % 0.13/0.35 cnf(a1, assumption, % 0.13/0.35 X1 = equivalent(X2,equivalent(equivalent(X3,equivalent(X2,X4)),equivalent(X4,X3)))). % 0.13/0.35 cnf(c6, plain, % 0.13/0.35 ~is_a_theorem(equivalent(X1,X0)), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.13/0.35 cnf(c7, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.13/0.35 % 0.13/0.35 cnf(c8, axiom, % 0.13/0.35 is_a_theorem(X5) | ~is_a_theorem(X6) | ~is_a_theorem(equivalent(X6,X5))). % 0.13/0.35 cnf(a2, assumption, % 0.13/0.35 equivalent(X1,X0) = X5). % 0.13/0.35 cnf(c9, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.13/0.35 cnf(c10, plain, % 0.13/0.35 ~is_a_theorem(X6) | ~is_a_theorem(equivalent(X6,X5)), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.13/0.35 % 0.13/0.35 cnf(c11, axiom, % 0.13/0.35 is_a_theorem(equivalent(X7,equivalent(equivalent(X8,equivalent(X7,X9)),equivalent(X9,X8))))). % 0.13/0.35 cnf(a3, assumption, % 0.13/0.35 X6 = equivalent(X7,equivalent(equivalent(X8,equivalent(X7,X9)),equivalent(X9,X8)))). % 0.13/0.35 cnf(c12, plain, % 0.13/0.35 ~is_a_theorem(equivalent(X6,X5)), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.13/0.35 cnf(c13, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.13/0.35 % 0.13/0.35 cnf(c14, axiom, % 0.13/0.35 is_a_theorem(equivalent(X10,equivalent(equivalent(X11,equivalent(X10,X12)),equivalent(X12,X11))))). % 0.13/0.35 cnf(a4, assumption, % 0.13/0.35 equivalent(X6,X5) = equivalent(X10,equivalent(equivalent(X11,equivalent(X10,X12)),equivalent(X12,X11)))). % 0.13/0.35 cnf(c15, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])). % 0.13/0.35 cnf(c16, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])). % 0.13/0.35 % 0.13/0.35 cnf(c17, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(constraint_solving, [ % 0.13/0.35 bind(X0, equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))), % 0.13/0.35 bind(X1, equivalent(X2,equivalent(equivalent(X3,equivalent(X2,X4)),equivalent(X4,X3)))), % 0.13/0.35 bind(X2, equivalent(X8,equivalent(X7,X9))), % 0.13/0.35 bind(X3, c), % 0.13/0.35 bind(X4, equivalent(X9,X8)), % 0.13/0.35 bind(X5, equivalent(X1,X0)), % 0.13/0.35 bind(X6, equivalent(X7,equivalent(equivalent(X8,equivalent(X7,X9)),equivalent(X9,X8)))), % 0.13/0.35 bind(X7, c), % 0.13/0.35 bind(X8, b), % 0.13/0.35 bind(X9, a), % 0.13/0.35 bind(X10, equivalent(X7,equivalent(equivalent(X8,equivalent(X7,X9)),equivalent(X9,X8)))), % 0.13/0.35 bind(X11, equivalent(X8,equivalent(X7,X9))), % 0.13/0.35 bind(X12, equivalent(X4,X3)) % 0.13/0.35 ], % 0.13/0.35 [a0, a1, a2, a3, a4])). % 0.13/0.35 % 0.13/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------