%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL198-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/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:16 AM UTC 2026
% Result : Unsatisfiable 0.89s 0.57s
% Output : CNFRefutation 0.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 35 ( 22 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 21 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 71 ( 10 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(or(not(or(not(VAR_0),VAR_1)),or(not(or(VAR_2,VAR_0)),or(VAR_2,VAR_1)))),
file('theBenchmark.p',axiom_1_6) ).
cnf(c_2,plain,
axiom(or(not(or(not(A),B)),or(not(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(or(not(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(or(not(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(or(not(or(VAR_0,VAR_1)),or(VAR_1,VAR_0))),
file('theBenchmark.p',axiom_1_4) ).
cnf(c_4,plain,
axiom(or(not(or(A,B)),or(B,A))),
inference(clausify,[status(thm)],[axiom_1_4]) ).
fof(axiom_1_3,axiom,
! [VAR_0,VAR_1] : axiom(or(not(VAR_0),or(VAR_1,VAR_0))),
file('theBenchmark.p',axiom_1_3) ).
cnf(c_5,plain,
axiom(or(not(A),or(B,A))),
inference(clausify,[status(thm)],[axiom_1_3]) ).
fof(axiom_1_2,axiom,
! [VAR_0] : axiom(or(not(or(VAR_0,VAR_0)),VAR_0)),
file('theBenchmark.p',axiom_1_2) ).
cnf(c_6,plain,
axiom(or(not(or(A,A)),A)),
inference(clausify,[status(thm)],[axiom_1_2]) ).
fof(rule_2,axiom,
! [VAR_0,VAR_1] :
( ~ theorem(VAR_1)
| ~ axiom(or(not(VAR_1),VAR_0))
| theorem(VAR_0) ),
file('theBenchmark.p',rule_2) ).
cnf(c_7,plain,
( ~ theorem(B)
| ~ axiom(or(not(B),A))
| theorem(A) ),
inference(clausify,[status(thm)],[rule_2]) ).
fof(rule_3,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ theorem(or(not(VAR_2),VAR_1))
| ~ axiom(or(not(VAR_0),VAR_2))
| theorem(or(not(VAR_0),VAR_1)) ),
file('theBenchmark.p',rule_3) ).
cnf(c_8,plain,
( ~ theorem(or(not(C),B))
| ~ axiom(or(not(A),C))
| theorem(or(not(A),B)) ),
inference(clausify,[status(thm)],[rule_3]) ).
cnf(c_10,plain,
( ~ theorem(or(not(or(C,A)),B))
| theorem(or(not(A),B)) ),
inference(resolve,[status(thm)],[c_8,c_5]) ).
cnf(c_11,plain,
( ~ theorem(or(not(or(B,A)),C))
| theorem(or(not(or(A,B)),C)) ),
inference(resolve,[status(thm)],[c_8,c_4]) ).
cnf(c_14,plain,
( ~ theorem(or(A,A))
| theorem(A) ),
inference(resolve,[status(thm)],[c_7,c_6]) ).
cnf(c_15,plain,
( ~ theorem(B)
| theorem(or(A,B)) ),
inference(resolve,[status(thm)],[c_7,c_5]) ).
cnf(c_16,plain,
( ~ theorem(or(B,A))
| theorem(or(A,B)) ),
inference(resolve,[status(thm)],[c_7,c_4]) ).
cnf(c_17,plain,
( ~ theorem(or(B,or(A,C)))
| theorem(or(A,or(B,C))) ),
inference(resolve,[status(thm)],[c_7,c_3]) ).
cnf(c_18,plain,
( ~ theorem(or(not(B),C))
| theorem(or(not(or(A,B)),or(A,C))) ),
inference(resolve,[status(thm)],[c_7,c_2]) ).
cnf(c_21,plain,
theorem(or(not(or(A,B)),or(B,A))),
inference(resolve,[status(thm)],[c_1,c_4]) ).
fof(prove_this,axiom,
~ theorem(or(not(or(not(p),or(not(p),q))),or(not(p),q))),
file('theBenchmark.p',prove_this) ).
cnf(c_24,plain,
~ theorem(or(not(or(not(p),or(not(p),q))),or(not(p),q))),
inference(clausify,[status(thm)],[prove_this]) ).
cnf(c_47,plain,
theorem(or(not(A),or(A,B))),
inference(resolve,[status(thm)],[c_10,c_21]) ).
cnf(c_68,plain,
~ theorem(or(or(not(or(not(p),or(not(p),q))),or(not(p),q)),or(not(or(not(p),or(not(p),q))),or(not(p),q)))),
inference(resolve,[status(thm)],[c_24,c_14]) ).
cnf(c_98,plain,
theorem(or(not(or(A,B)),or(A,or(B,C)))),
inference(resolve,[status(thm)],[c_18,c_47]) ).
cnf(c_378,plain,
theorem(or(not(or(A,B)),or(B,or(A,C)))),
inference(resolve,[status(thm)],[c_11,c_98]) ).
cnf(c_471,plain,
theorem(or(A,or(not(or(B,A)),or(B,C)))),
inference(resolve,[status(thm)],[c_17,c_378]) ).
cnf(c_1047,plain,
theorem(or(or(not(or(A,B)),or(A,C)),B)),
inference(resolve,[status(thm)],[c_16,c_471]) ).
cnf(c_1226,plain,
theorem(or(A,or(or(not(or(B,C)),or(B,D)),C))),
inference(resolve,[status(thm)],[c_15,c_1047]) ).
cnf(c_1231,plain,
~ theorem(or(not(or(not(p),or(not(p),q))),or(or(not(or(not(p),or(not(p),q))),or(not(p),q)),or(not(p),q)))),
inference(resolve,[status(thm)],[c_68,c_17]) ).
cnf(c_1230,plain,
$false,
inference(resolve,[status(thm)],[c_1226,c_1231]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL198-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n020.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Fri Sep 25 22:00:34 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.37 % Process 3903078 was started by sandbox2 on n020,
% 0.08/0.37 % Fri Sep 25 22:00:34 2026
% 0.08/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.37
% 0.08/0.37 % From the command line: assign(max_seconds, 300).
% 0.89/0.57
% 0.89/0.57 % Assigning unary symbol not kb_weight 0 and highest precedence (5).
% 0.89/0.57
% 0.89/0.57 % SZS status Unsatisfiable for theBenchmark
% 0.89/0.57
% 0.89/0.57 % Proof 1 at 0.13 (+ 0.05) seconds.
% 0.89/0.57 % Length of proof is 25.
% 0.89/0.57 % Level of proof is 8.
% 0.89/0.57 % Maximum clause weight is 75.000.
% 0.89/0.57 % Given clauses 369.
% 0.89/0.57
% 0.89/0.57 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------