%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL326-3 : TPTP v9.3.1. Released v2.3.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:36 AM UTC 2026
% Result : Unsatisfiable 20.01s 2.98s
% Output : CNFRefutation 20.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 64 ( 47 unt; 0 def)
% Number of atoms : 84 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 52 ( 32 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 108 ( 5 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rule_1,axiom,
! [VAR_0] :
( ~ axiom(VAR_0)
| theorem(VAR_0) ),
file('theBenchmark.p',rule_1) ).
cnf(c_1,plain,
( ~ axiom(A)
| theorem(A) ),
inference(clausify,[status(thm)],[rule_1]) ).
fof(axiom_1_6,axiom,
! [VAR_0,VAR_1,VAR_2] : axiom(implies(implies(VAR_0,VAR_1),implies(or(VAR_2,VAR_0),or(VAR_2,VAR_1)))),
file('theBenchmark.p',axiom_1_6) ).
cnf(c_2,plain,
axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
inference(clausify,[status(thm)],[axiom_1_6]) ).
fof(axiom_1_5,axiom,
! [VAR_0,VAR_1,VAR_2] : axiom(implies(or(VAR_0,or(VAR_1,VAR_2)),or(VAR_1,or(VAR_0,VAR_2)))),
file('theBenchmark.p',axiom_1_5) ).
cnf(c_3,plain,
axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
inference(clausify,[status(thm)],[axiom_1_5]) ).
fof(axiom_1_4,axiom,
! [VAR_0,VAR_1] : axiom(implies(or(VAR_0,VAR_1),or(VAR_1,VAR_0))),
file('theBenchmark.p',axiom_1_4) ).
cnf(c_4,plain,
axiom(implies(or(A,B),or(B,A))),
inference(clausify,[status(thm)],[axiom_1_4]) ).
fof(axiom_1_3,axiom,
! [VAR_0,VAR_1] : axiom(implies(VAR_0,or(VAR_1,VAR_0))),
file('theBenchmark.p',axiom_1_3) ).
cnf(c_5,plain,
axiom(implies(A,or(B,A))),
inference(clausify,[status(thm)],[axiom_1_3]) ).
fof(axiom_1_2,axiom,
! [VAR_0] : axiom(implies(or(VAR_0,VAR_0),VAR_0)),
file('theBenchmark.p',axiom_1_2) ).
cnf(c_6,plain,
axiom(implies(or(A,A),A)),
inference(clausify,[status(thm)],[axiom_1_2]) ).
cnf(c_7,plain,
theorem(implies(or(A,A),A)),
inference(resolve,[status(thm)],[c_1,c_6]) ).
cnf(c_8,plain,
theorem(implies(A,or(B,A))),
inference(resolve,[status(thm)],[c_1,c_5]) ).
cnf(c_9,plain,
theorem(implies(or(A,B),or(B,A))),
inference(resolve,[status(thm)],[c_1,c_4]) ).
cnf(c_10,plain,
theorem(implies(or(A,or(B,C)),or(B,or(A,C)))),
inference(resolve,[status(thm)],[c_1,c_3]) ).
cnf(c_11,plain,
theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(prove_this,axiom,
~ theorem(not(equivalent(p,not(p)))),
file('theBenchmark.p',prove_this) ).
cnf(c_12,plain,
~ theorem(not(equivalent(p,not(p)))),
inference(clausify,[status(thm)],[prove_this]) ).
fof(equivalent_defn,axiom,
! [VAR_0,VAR_1] : equivalent(VAR_0,VAR_1) = and(implies(VAR_0,VAR_1),implies(VAR_1,VAR_0)),
file('theBenchmark.p',equivalent_defn) ).
cnf(c_13,plain,
equivalent(A,B) = and(implies(A,B),implies(B,A)),
inference(clausify,[status(thm)],[equivalent_defn]) ).
fof(and_defn,axiom,
! [VAR_0,VAR_1] : and(VAR_0,VAR_1) = not(or(not(VAR_0),not(VAR_1))),
file('theBenchmark.p',and_defn) ).
cnf(c_14,plain,
and(A,B) = not(or(not(A),not(B))),
inference(clausify,[status(thm)],[and_defn]) ).
fof(rule_2,axiom,
! [VAR_0,VAR_1] :
( ~ theorem(VAR_1)
| ~ theorem(implies(VAR_1,VAR_0))
| theorem(VAR_0) ),
file('theBenchmark.p',rule_2) ).
cnf(c_15,plain,
( ~ theorem(B)
| ~ theorem(implies(B,A))
| theorem(A) ),
inference(clausify,[status(thm)],[rule_2]) ).
fof(implies_definition,axiom,
! [VAR_0,VAR_1] : implies(VAR_0,VAR_1) = or(not(VAR_0),VAR_1),
file('theBenchmark.p',implies_definition) ).
cnf(c_16,plain,
implies(A,B) = or(not(A),B),
inference(clausify,[status(thm)],[implies_definition]) ).
cnf(c_2799,plain,
~ theorem(not(and(implies(p,not(p)),implies(not(p),p)))),
inference(paramod,[status(thm)],[c_13,c_12]) ).
cnf(c_2800,plain,
~ theorem(not(and(or(not(p),not(p)),implies(not(p),p)))),
inference(paramod,[status(thm)],[c_16,c_2799]) ).
cnf(c_2801,plain,
~ theorem(not(and(or(not(p),not(p)),or(not(not(p)),p)))),
inference(paramod,[status(thm)],[c_16,c_2800]) ).
cnf(c_17,plain,
~ theorem(not(not(or(not(or(not(p),not(p))),not(or(not(not(p)),p)))))),
inference(paramod,[status(thm)],[c_14,c_2801]) ).
cnf(c_19,plain,
( ~ theorem(B)
| ~ theorem(or(not(B),A))
| theorem(A) ),
inference(paramod,[status(thm)],[c_16,c_15]) ).
cnf(c_2802,plain,
theorem(implies(or(not(A),B),implies(or(C,A),or(C,B)))),
inference(paramod,[status(thm)],[c_16,c_11]) ).
cnf(c_2803,plain,
theorem(implies(or(not(A),B),or(not(or(C,A)),or(C,B)))),
inference(paramod,[status(thm)],[c_16,c_2802]) ).
cnf(c_20,plain,
theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
inference(paramod,[status(thm)],[c_16,c_2803]) ).
cnf(c_21,plain,
theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))),
inference(paramod,[status(thm)],[c_16,c_10]) ).
cnf(c_22,plain,
theorem(or(not(or(A,B)),or(B,A))),
inference(paramod,[status(thm)],[c_16,c_9]) ).
cnf(c_23,plain,
theorem(or(not(A),or(B,A))),
inference(paramod,[status(thm)],[c_16,c_8]) ).
cnf(c_24,plain,
theorem(or(not(or(A,A)),A)),
inference(paramod,[status(thm)],[c_16,c_7]) ).
cnf(c_2804,plain,
( ~ theorem(or(B,or(A,C)))
| theorem(or(A,or(B,C))) ),
inference(resolve,[status(thm)],[c_19,c_21]) ).
cnf(c_32,plain,
theorem(or(A,or(not(B),B))),
inference(resolve,[status(thm)],[c_2804,c_23]) ).
cnf(c_2805,plain,
( ~ theorem(or(not(B),C))
| theorem(or(not(or(A,B)),or(A,C))) ),
inference(resolve,[status(thm)],[c_19,c_20]) ).
cnf(c_37,plain,
theorem(or(not(or(A,or(B,B))),or(A,B))),
inference(resolve,[status(thm)],[c_2805,c_24]) ).
cnf(c_2806,plain,
( ~ theorem(B)
| theorem(or(not(A),A)) ),
inference(resolve,[status(thm)],[c_19,c_32]) ).
cnf(c_48,plain,
theorem(or(not(A),A)),
inference(resolve,[status(thm)],[c_2806,c_32]) ).
cnf(c_2807,plain,
( ~ theorem(or(B,A))
| theorem(or(A,B)) ),
inference(resolve,[status(thm)],[c_19,c_22]) ).
cnf(c_53,plain,
theorem(or(A,not(A))),
inference(resolve,[status(thm)],[c_2807,c_48]) ).
cnf(c_2808,plain,
( ~ theorem(or(not(B),C))
| theorem(or(not(or(A,B)),or(A,C))) ),
inference(resolve,[status(thm)],[c_19,c_20]) ).
cnf(c_59,plain,
theorem(or(not(or(A,B)),or(A,not(not(B))))),
inference(resolve,[status(thm)],[c_2808,c_53]) ).
cnf(c_2809,plain,
( ~ theorem(A)
| ~ theorem(or(not(A),not(not(or(not(or(not(p),not(p))),not(or(not(not(p)),p))))))) ),
inference(resolve,[status(thm)],[c_19,c_17]) ).
cnf(c_69,plain,
~ theorem(or(not(or(not(p),not(p))),not(or(not(not(p)),p)))),
inference(resolve,[status(thm)],[c_2809,c_53]) ).
cnf(c_2810,plain,
( ~ theorem(A)
| ~ theorem(or(not(A),or(not(or(not(p),not(p))),not(or(not(not(p)),p))))) ),
inference(resolve,[status(thm)],[c_19,c_69]) ).
cnf(c_78,plain,
~ theorem(or(not(or(not(not(p)),p)),not(or(not(p),not(p))))),
inference(resolve,[status(thm)],[c_2810,c_22]) ).
cnf(c_2811,plain,
( ~ theorem(or(A,or(B,B)))
| theorem(or(A,B)) ),
inference(resolve,[status(thm)],[c_19,c_37]) ).
cnf(c_884,plain,
theorem(or(not(or(not(not(A)),A)),not(not(A)))),
inference(resolve,[status(thm)],[c_2811,c_59]) ).
cnf(c_2812,plain,
( ~ theorem(or(A,B))
| theorem(or(A,not(not(B)))) ),
inference(resolve,[status(thm)],[c_19,c_59]) ).
cnf(c_925,plain,
theorem(or(not(or(A,A)),not(not(A)))),
inference(resolve,[status(thm)],[c_2812,c_24]) ).
cnf(c_2813,plain,
( ~ theorem(or(B,A))
| theorem(or(A,B)) ),
inference(resolve,[status(thm)],[c_19,c_22]) ).
cnf(c_933,plain,
theorem(or(not(not(A)),not(or(A,A)))),
inference(resolve,[status(thm)],[c_2813,c_925]) ).
cnf(c_2814,plain,
( ~ theorem(or(not(B),C))
| theorem(or(not(or(A,B)),or(A,C))) ),
inference(resolve,[status(thm)],[c_19,c_20]) ).
cnf(c_945,plain,
theorem(or(not(or(A,not(B))),or(A,not(or(B,B))))),
inference(resolve,[status(thm)],[c_2814,c_933]) ).
cnf(c_2815,plain,
( ~ theorem(A)
| ~ theorem(or(not(A),or(not(or(not(not(p)),p)),not(or(not(p),not(p)))))) ),
inference(resolve,[status(thm)],[c_19,c_78]) ).
cnf(c_2797,plain,
~ theorem(or(not(or(not(not(p)),p)),not(not(p)))),
inference(resolve,[status(thm)],[c_2815,c_945]) ).
cnf(c_2798,plain,
$false,
inference(resolve,[status(thm)],[c_2797,c_884]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL326-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n014.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Fri Sep 25 22:15:32 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.36 % Process 1247974 was started by sandbox2 on n014,
% 0.11/0.36 % Fri Sep 25 22:15:32 2026
% 0.11/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.14/0.37
% 0.14/0.37 % From the command line: assign(max_seconds, 300).
% 20.01/2.98
% 20.01/2.98 % given #500 (T,wt=25): 931 theorem(or(not(or(A,A)),or(B,not(not(A))))). [hyper(19,b,33,a,c,925,a)].
% 20.01/2.98
% 20.01/2.98 % SZS status Unsatisfiable for theBenchmark
% 20.01/2.98
% 20.01/2.98 % Proof 1 at 1.65 (+ 0.93) seconds.
% 20.01/2.98 % Length of proof is 36.
% 20.01/2.98 % Level of proof is 11.
% 20.01/2.98 % Maximum clause weight is 36.000.
% 20.01/2.98 % Given clauses 519.
% 20.01/2.98
% 20.01/2.98 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------