%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : LCL007-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 : n009.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.09s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL007-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.36 % Computer : n009.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Fri Sep 4 17:51:21 UTC 2026 % 0.09/0.36 % CPUTime : % 0.09/0.37 % SZS status Unsatisfiable % 0.09/0.37 % SZS output begin IncompleteProof % 0.09/0.37 cnf(c0, axiom, % 0.09/0.37 ~is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c)))). % 0.09/0.37 cnf(c1, plain, % 0.09/0.37 ~is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c))), % 0.09/0.37 inference(start, [], [c0])). % 0.09/0.37 % 0.09/0.37 cnf(c2, axiom, % 0.09/0.37 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(equivalent(X1,X0))). % 0.09/0.37 cnf(a0, assumption, % 0.09/0.37 equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c)) = X0). % 0.09/0.37 cnf(c3, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.37 cnf(c4, plain, % 0.09/0.37 ~is_a_theorem(X1) | ~is_a_theorem(equivalent(X1,X0)), % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.37 % 0.09/0.37 cnf(c5, axiom, % 0.09/0.37 is_a_theorem(equivalent(equivalent(equivalent(X2,X3),X4),equivalent(X2,equivalent(X3,X4))))). % 0.09/0.37 cnf(a1, assumption, % 0.09/0.37 X1 = equivalent(equivalent(equivalent(X2,X3),X4),equivalent(X2,equivalent(X3,X4)))). % 0.09/0.37 cnf(c6, plain, % 0.09/0.37 ~is_a_theorem(equivalent(X1,X0)), % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.09/0.37 cnf(c7, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.09/0.37 % 0.09/0.37 cnf(c8, axiom, % 0.09/0.37 is_a_theorem(equivalent(equivalent(X5,X6),equivalent(X6,X5)))). % 0.09/0.37 cnf(a2, assumption, % 0.09/0.37 equivalent(X1,X0) = equivalent(equivalent(X5,X6),equivalent(X6,X5))). % 0.09/0.37 cnf(c9, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.09/0.37 cnf(c10, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.09/0.37 % 0.09/0.37 cnf(c11, plain, % 0.09/0.37 $false, % 0.09/0.37 inference(constraint_solving, [ % 0.09/0.37 bind(X0, equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c))), % 0.09/0.37 bind(X1, equivalent(equivalent(equivalent(X2,X3),X4),equivalent(X2,equivalent(X3,X4)))), % 0.09/0.37 bind(X2, a), % 0.09/0.37 bind(X3, b), % 0.09/0.37 bind(X4, c), % 0.09/0.37 bind(X5, equivalent(equivalent(X2,X3),X4)), % 0.09/0.37 bind(X6, equivalent(X2,equivalent(X3,X4))) % 0.09/0.37 ], % 0.09/0.37 [a0, a1, a2])). % 0.09/0.37 % 0.09/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------