%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL113-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n014.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 : Sun Sep 27 07:58:01 AM UTC 2026
% Result : Unsatisfiable 0.18s 5.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 5
% Syntax : Number of formulae : 55 ( 55 unt; 0 def)
% Number of atoms : 55 ( 54 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 66 ( 8 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(wajsberg_1,axiom,
! [VAR_0] : implies(truth,VAR_0) = VAR_0,
file('theBenchmark.p',wajsberg_1) ).
cnf(c_1,plain,
implies(truth,A) = A,
inference(clausify,[status(thm)],[wajsberg_1]) ).
fof(wajsberg_2,axiom,
! [VAR_0,VAR_1,VAR_2] : implies(implies(VAR_0,VAR_1),implies(implies(VAR_1,VAR_2),implies(VAR_0,VAR_2))) = truth,
file('theBenchmark.p',wajsberg_2) ).
cnf(c_2,plain,
implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth,
inference(clausify,[status(thm)],[wajsberg_2]) ).
fof(wajsberg_3,axiom,
! [VAR_0,VAR_1] : implies(implies(VAR_0,VAR_1),VAR_1) = implies(implies(VAR_1,VAR_0),VAR_0),
file('theBenchmark.p',wajsberg_3) ).
cnf(c_3,plain,
implies(implies(A,B),B) = implies(implies(B,A),A),
inference(clausify,[status(thm)],[wajsberg_3]) ).
fof(wajsberg_4,axiom,
! [VAR_0,VAR_1] : implies(implies(not(VAR_0),not(VAR_1)),implies(VAR_1,VAR_0)) = truth,
file('theBenchmark.p',wajsberg_4) ).
cnf(c_4,plain,
implies(implies(not(A),not(B)),implies(B,A)) = truth,
inference(clausify,[status(thm)],[wajsberg_4]) ).
fof(prove_mv_33,axiom,
implies(implies(not(x),y),implies(not(y),x)) != truth,
file('theBenchmark.p',prove_mv_33) ).
cnf(c_5,plain,
implies(implies(not(x),y),implies(not(y),x)) != truth,
inference(clausify,[status(thm)],[prove_mv_33]) ).
cnf(c_72,plain,
implies(A,implies(implies(A,B),implies(truth,B))) = truth,
inference(paramod,[status(thm)],[c_1,c_2]) ).
cnf(c_6,plain,
implies(A,implies(implies(A,B),B)) = truth,
inference(paramod,[status(thm)],[c_1,c_72]) ).
cnf(c_7,plain,
implies(implies(A,truth),implies(B,implies(A,B))) = truth,
inference(paramod,[status(thm)],[c_1,c_2]) ).
cnf(c_73,plain,
implies(A,A) = implies(implies(A,truth),truth),
inference(paramod,[status(thm)],[c_1,c_3]) ).
cnf(c_9,plain,
implies(implies(A,truth),truth) = implies(A,A),
inference(copy,[status(thm)],[c_73]) ).
cnf(c_10,plain,
implies(implies(not(A),not(truth)),A) = truth,
inference(paramod,[status(thm)],[c_1,c_4]) ).
cnf(c_74,plain,
truth = implies(implies(truth,A),A),
inference(paramod,[status(thm)],[c_6,c_1]) ).
cnf(c_75,plain,
truth = implies(A,A),
inference(paramod,[status(thm)],[c_1,c_74]) ).
cnf(c_13,plain,
implies(A,A) = truth,
inference(copy,[status(thm)],[c_75]) ).
cnf(c_16,plain,
implies(implies(A,truth),truth) = truth,
inference(paramod,[status(thm)],[c_13,c_9]) ).
cnf(c_23,plain,
implies(A,truth) = truth,
inference(paramod,[status(thm)],[c_16,c_6]) ).
cnf(c_76,plain,
implies(truth,implies(B,implies(A,B))) = truth,
inference(paramod,[status(thm)],[c_23,c_7]) ).
cnf(c_24,plain,
implies(A,implies(B,A)) = truth,
inference(paramod,[status(thm)],[c_1,c_76]) ).
cnf(c_77,plain,
implies(truth,implies(implies(implies(A,B),C),implies(B,C))) = truth,
inference(paramod,[status(thm)],[c_24,c_2]) ).
cnf(c_25,plain,
implies(implies(implies(A,B),C),implies(B,C)) = truth,
inference(paramod,[status(thm)],[c_1,c_77]) ).
cnf(c_78,plain,
implies(truth,implies(implies(A,B),implies(implies(not(A),not(truth)),B))) = truth,
inference(paramod,[status(thm)],[c_10,c_2]) ).
cnf(c_27,plain,
implies(implies(A,B),implies(implies(not(A),not(truth)),B)) = truth,
inference(paramod,[status(thm)],[c_1,c_78]) ).
cnf(c_79,plain,
truth = implies(implies(not(truth),not(not(truth))),not(not(truth))),
inference(paramod,[status(thm)],[c_10,c_3]) ).
cnf(c_29,plain,
implies(implies(not(truth),not(not(truth))),not(not(truth))) = truth,
inference(copy,[status(thm)],[c_79]) ).
cnf(c_80,plain,
implies(truth,implies(not(truth),A)) = truth,
inference(paramod,[status(thm)],[c_10,c_25]) ).
cnf(c_34,plain,
implies(not(truth),A) = truth,
inference(paramod,[status(thm)],[c_1,c_80]) ).
cnf(c_81,plain,
implies(truth,not(not(truth))) = truth,
inference(paramod,[status(thm)],[c_34,c_29]) ).
cnf(c_35,plain,
not(not(truth)) = truth,
inference(paramod,[status(thm)],[c_1,c_81]) ).
cnf(c_82,plain,
implies(truth,A) = implies(implies(A,not(truth)),not(truth)),
inference(paramod,[status(thm)],[c_34,c_3]) ).
cnf(c_83,plain,
A = implies(implies(A,not(truth)),not(truth)),
inference(paramod,[status(thm)],[c_1,c_82]) ).
cnf(c_41,plain,
implies(implies(A,not(truth)),not(truth)) = A,
inference(copy,[status(thm)],[c_83]) ).
cnf(c_84,plain,
implies(implies(not(not(truth)),not(implies(A,not(truth)))),A) = truth,
inference(paramod,[status(thm)],[c_41,c_4]) ).
cnf(c_85,plain,
implies(implies(truth,not(implies(A,not(truth)))),A) = truth,
inference(paramod,[status(thm)],[c_35,c_84]) ).
cnf(c_48,plain,
implies(not(implies(A,not(truth))),A) = truth,
inference(paramod,[status(thm)],[c_1,c_85]) ).
cnf(c_86,plain,
implies(truth,A) = implies(implies(A,not(implies(A,not(truth)))),not(implies(A,not(truth)))),
inference(paramod,[status(thm)],[c_48,c_3]) ).
cnf(c_87,plain,
A = implies(implies(A,not(implies(A,not(truth)))),not(implies(A,not(truth)))),
inference(paramod,[status(thm)],[c_1,c_86]) ).
cnf(c_51,plain,
implies(implies(A,not(implies(A,not(truth)))),not(implies(A,not(truth)))) = A,
inference(copy,[status(thm)],[c_87]) ).
cnf(c_88,plain,
implies(A,implies(implies(not(implies(A,not(truth))),not(truth)),not(truth))) = truth,
inference(paramod,[status(thm)],[c_41,c_27]) ).
cnf(c_89,plain,
implies(A,implies(implies(not(truth),not(implies(A,not(truth)))),not(implies(A,not(truth))))) = truth,
inference(paramod,[status(thm)],[c_3,c_88]) ).
cnf(c_90,plain,
implies(A,implies(truth,not(implies(A,not(truth))))) = truth,
inference(paramod,[status(thm)],[c_34,c_89]) ).
cnf(c_58,plain,
implies(A,not(implies(A,not(truth)))) = truth,
inference(paramod,[status(thm)],[c_1,c_90]) ).
cnf(c_91,plain,
implies(truth,not(implies(A,not(truth)))) = A,
inference(paramod,[status(thm)],[c_58,c_51]) ).
cnf(c_59,plain,
not(implies(A,not(truth))) = A,
inference(paramod,[status(thm)],[c_1,c_91]) ).
cnf(c_92,plain,
not(implies(implies(not(truth),A),A)) = implies(A,not(truth)),
inference(paramod,[status(thm)],[c_3,c_59]) ).
cnf(c_93,plain,
not(implies(truth,A)) = implies(A,not(truth)),
inference(paramod,[status(thm)],[c_34,c_92]) ).
cnf(c_62,plain,
not(A) = implies(A,not(truth)),
inference(paramod,[status(thm)],[c_1,c_93]) ).
cnf(c_64,plain,
implies(implies(not(A),B),implies(implies(B,not(truth)),A)) = truth,
inference(paramod,[status(thm)],[c_59,c_4]) ).
cnf(c_94,plain,
implies(implies(not(x),y),implies(implies(y,not(truth)),x)) != truth,
inference(paramod,[status(thm)],[c_62,c_5]) ).
cnf(c_95,plain,
truth != truth,
inference(paramod,[status(thm)],[c_64,c_94]) ).
cnf(c_71,plain,
$false,
inference(copy,[status(thm)],[c_95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL113-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/5.44 % Computer : n014.cluster.edu
% 0.18/5.44 % Model : x86_64 x86_64
% 0.18/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.44 % Memory : 8046.5625MB
% 0.18/5.44 % OS : Linux 6.8.0-71-generic
% 0.18/5.44 % CPULimit : 300
% 0.18/5.44 % WCLimit : 300
% 0.18/5.44 % DateTime : Fri Sep 25 21:52:38 UTC 2026
% 0.18/5.44 % CPUTime :
% 0.18/5.45 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/5.45 % Process 1188131 was started by sandbox2 on n014,
% 0.18/5.45 % Fri Sep 25 21:52:38 2026
% 0.18/5.45 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.18/5.45
% 0.18/5.45 % From the command line: assign(max_seconds, 300).
% 0.18/5.47
% 0.18/5.47 % SZS status Unsatisfiable for theBenchmark
% 0.18/5.47
% 0.18/5.47 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.18/5.47 % Length of proof is 26.
% 0.18/5.47 % Level of proof is 13.
% 0.18/5.47 % Maximum clause weight is 29.000.
% 0.18/5.47 % Given clauses 23.
% 0.18/5.47
% 0.18/5.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------