%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL235-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.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:25 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.67s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 46 ( 34 unt; 0 def)
% Number of atoms : 61 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 23 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 87 ( 5 sgn 17 !; 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]) ).
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(implies(not(and(p,q)),or(not(p),not(q)))),
file('theBenchmark.p',prove_this) ).
cnf(c_12,plain,
~ theorem(implies(not(and(p,q)),or(not(p),not(q)))),
inference(clausify,[status(thm)],[prove_this]) ).
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_13,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_14,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_15,plain,
implies(A,B) = or(not(A),B),
inference(clausify,[status(thm)],[implies_definition]) ).
cnf(c_888,plain,
~ theorem(implies(not(not(or(not(p),not(q)))),or(not(p),not(q)))),
inference(paramod,[status(thm)],[c_13,c_12]) ).
cnf(c_16,plain,
~ theorem(or(not(not(not(or(not(p),not(q))))),or(not(p),not(q)))),
inference(paramod,[status(thm)],[c_15,c_888]) ).
cnf(c_17,plain,
( ~ theorem(B)
| ~ theorem(or(not(B),A))
| theorem(A) ),
inference(paramod,[status(thm)],[c_15,c_14]) ).
cnf(c_889,plain,
theorem(implies(or(not(A),B),implies(or(C,A),or(C,B)))),
inference(paramod,[status(thm)],[c_15,c_11]) ).
cnf(c_890,plain,
theorem(implies(or(not(A),B),or(not(or(C,A)),or(C,B)))),
inference(paramod,[status(thm)],[c_15,c_889]) ).
cnf(c_18,plain,
theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
inference(paramod,[status(thm)],[c_15,c_890]) ).
cnf(c_19,plain,
theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))),
inference(paramod,[status(thm)],[c_15,c_10]) ).
cnf(c_20,plain,
theorem(or(not(or(A,B)),or(B,A))),
inference(paramod,[status(thm)],[c_15,c_9]) ).
cnf(c_21,plain,
theorem(or(not(A),or(B,A))),
inference(paramod,[status(thm)],[c_15,c_8]) ).
cnf(c_891,plain,
( ~ theorem(or(B,or(A,C)))
| theorem(or(A,or(B,C))) ),
inference(resolve,[status(thm)],[c_17,c_19]) ).
cnf(c_26,plain,
theorem(or(not(or(A,B)),or(not(or(not(B),C)),or(A,C)))),
inference(resolve,[status(thm)],[c_891,c_18]) ).
cnf(c_892,plain,
( ~ theorem(A)
| ~ theorem(or(not(A),or(not(not(not(or(not(p),not(q))))),or(not(p),not(q))))) ),
inference(resolve,[status(thm)],[c_17,c_16]) ).
cnf(c_34,plain,
~ theorem(or(or(not(p),not(q)),not(not(not(or(not(p),not(q))))))),
inference(resolve,[status(thm)],[c_892,c_20]) ).
cnf(c_893,plain,
( ~ theorem(or(B,or(A,C)))
| theorem(or(A,or(B,C))) ),
inference(resolve,[status(thm)],[c_17,c_19]) ).
cnf(c_37,plain,
theorem(or(A,or(not(B),B))),
inference(resolve,[status(thm)],[c_893,c_21]) ).
cnf(c_894,plain,
( ~ theorem(B)
| theorem(or(not(A),A)) ),
inference(resolve,[status(thm)],[c_17,c_37]) ).
cnf(c_142,plain,
theorem(or(not(A),A)),
inference(resolve,[status(thm)],[c_894,c_37]) ).
cnf(c_895,plain,
( ~ theorem(or(B,A))
| theorem(or(A,B)) ),
inference(resolve,[status(thm)],[c_17,c_20]) ).
cnf(c_154,plain,
theorem(or(A,not(A))),
inference(resolve,[status(thm)],[c_895,c_142]) ).
cnf(c_896,plain,
( ~ theorem(or(C,A))
| theorem(or(not(or(not(A),B)),or(C,B))) ),
inference(resolve,[status(thm)],[c_17,c_26]) ).
cnf(c_206,plain,
theorem(or(not(or(not(not(A)),B)),or(A,B))),
inference(resolve,[status(thm)],[c_896,c_154]) ).
cnf(c_897,plain,
( ~ theorem(A)
| ~ theorem(or(not(A),or(or(not(p),not(q)),not(not(not(or(not(p),not(q)))))))) ),
inference(resolve,[status(thm)],[c_17,c_34]) ).
cnf(c_886,plain,
~ theorem(or(not(or(A,not(A))),or(or(not(p),not(q)),not(not(not(or(not(p),not(q)))))))),
inference(resolve,[status(thm)],[c_897,c_154]) ).
cnf(c_887,plain,
$false,
inference(resolve,[status(thm)],[c_886,c_206]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL235-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.56 % Computer : n020.cluster.edu
% 0.09/0.56 % Model : x86_64 x86_64
% 0.09/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.56 % Memory : 8046.5625MB
% 0.09/0.56 % OS : Linux 6.8.0-71-generic
% 0.09/0.56 % CPULimit : 300
% 0.09/0.56 % WCLimit : 300
% 0.09/0.56 % DateTime : Fri Sep 25 22:05:35 UTC 2026
% 0.13/0.56 % CPUTime :
% 0.13/0.56 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.13/0.56 % Process 3918045 was started by sandbox on n020,
% 0.13/0.56 % Fri Sep 25 22:05:35 2026
% 0.13/0.56 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.56
% 0.13/0.56 % From the command line: assign(max_seconds, 300).
% 0.13/0.67
% 0.13/0.67 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.67
% 0.13/0.67 % Proof 1 at 0.08 (+ 0.02) seconds.
% 0.13/0.67 % Length of proof is 27.
% 0.13/0.67 % Level of proof is 7.
% 0.13/0.67 % Maximum clause weight is 81.000.
% 0.13/0.67 % Given clauses 51.
% 0.13/0.67
% 0.13/0.67 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------