%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL191-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 : n003.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:14 AM UTC 2026
% Result : Unsatisfiable 15.96s 2.43s
% Output : CNFRefutation 15.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 29 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 24 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 91 ( 22 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_12,plain,
( ~ theorem(or(not(or(B,or(A,C))),D))
| theorem(or(not(or(A,or(B,C))),D)) ),
inference(resolve,[status(thm)],[c_8,c_3]) ).
cnf(c_14,plain,
( ~ theorem(or(A,A))
| theorem(A) ),
inference(resolve,[status(thm)],[c_7,c_6]) ).
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(p,or(q,r))),or(or(p,q),r))),
file('theBenchmark.p',prove_this) ).
cnf(c_24,plain,
~ theorem(or(not(or(p,or(q,r))),or(or(p,q),r))),
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(not(or(q,or(p,r))),or(or(p,q),r))),
inference(resolve,[status(thm)],[c_24,c_12]) ).
cnf(c_111,plain,
theorem(or(not(or(A,B)),or(or(B,A),C))),
inference(resolve,[status(thm)],[c_11,c_47]) ).
cnf(c_443,plain,
theorem(or(not(A),or(or(A,B),C))),
inference(resolve,[status(thm)],[c_10,c_111]) ).
cnf(c_445,plain,
theorem(or(not(or(A,B)),or(A,or(or(B,C),D)))),
inference(resolve,[status(thm)],[c_18,c_443]) ).
cnf(c_740,plain,
~ theorem(or(not(or(or(p,r),q)),or(or(p,q),r))),
inference(resolve,[status(thm)],[c_68,c_11]) ).
cnf(c_2390,plain,
theorem(or(not(or(A,B)),or(B,or(or(A,C),D)))),
inference(resolve,[status(thm)],[c_11,c_445]) ).
cnf(c_2463,plain,
~ theorem(or(not(or(A,or(or(p,r),q))),or(or(p,q),r))),
inference(resolve,[status(thm)],[c_740,c_10]) ).
cnf(c_3345,plain,
theorem(or(not(or(A,or(B,C))),or(or(A,C),or(or(B,D),E)))),
inference(resolve,[status(thm)],[c_12,c_2390]) ).
cnf(c_7685,plain,
~ theorem(or(not(or(or(p,r),or(A,q))),or(or(p,q),r))),
inference(resolve,[status(thm)],[c_2463,c_12]) ).
cnf(c_7691,plain,
~ theorem(or(not(or(or(A,q),or(p,r))),or(or(p,q),r))),
inference(resolve,[status(thm)],[c_7685,c_11]) ).
cnf(c_7698,plain,
~ theorem(or(not(or(p,or(or(A,q),r))),or(or(p,q),r))),
inference(resolve,[status(thm)],[c_7691,c_12]) ).
cnf(c_9257,plain,
theorem(or(not(or(A,B)),or(or(C,B),or(or(A,D),E)))),
inference(resolve,[status(thm)],[c_10,c_3345]) ).
cnf(c_9260,plain,
theorem(or(or(A,B),or(not(or(C,B)),or(or(C,D),E)))),
inference(resolve,[status(thm)],[c_17,c_9257]) ).
cnf(c_9269,plain,
theorem(or(not(or(A,or(or(A,B),C))),or(or(A,B),C))),
inference(resolve,[status(thm)],[c_14,c_9260]) ).
cnf(c_9270,plain,
$false,
inference(resolve,[status(thm)],[c_9269,c_7698]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL191-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.10/0.37 % Computer : n003.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 22:00:53 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 1214379 was started by sandbox2 on n003,
% 0.10/0.37 % Fri Sep 25 22:00:53 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 15.96/2.43
% 15.96/2.43 % given #500 (F,wt=30): 1676 -theorem(or(or(q,or(p,p)),or(p,p))). [resolve(560,a,15,a)].
% 15.96/2.43
% 15.96/2.43 % given #1000 (W,wt=37): 3253 -theorem(or(r,or(or(or(p,q),or(r,r)),r))). [resolve(3251,a,17,a)].
% 15.96/2.43
% 15.96/2.43 % given #1500 (T,wt=38): 4107 theorem(or(or(not(or(A,B)),or(or(C,A),D)),B)). [ur(16,b,3072,a)].
% 15.96/2.43
% 15.96/2.43 % given #2000 (F,wt=30): 6180 -theorem(or(or(q,q),or(or(q,q),q))). [resolve(6174,a,16,a)].
% 15.96/2.43
% 15.96/2.43 % given #2500 (W,wt=27): 7802 -theorem(not(or(A,or(p,r)))). [resolve(7777,a,15,a)].
% 15.96/2.43
% 15.96/2.43 % SZS status Unsatisfiable for theBenchmark
% 15.96/2.43
% 15.96/2.43 % Proof 1 at 1.64 (+ 0.35) seconds.
% 15.96/2.43 % Length of proof is 32.
% 15.96/2.43 % Level of proof is 11.
% 15.96/2.43 % Maximum clause weight is 45.000.
% 15.96/2.43 % Given clauses 2931.
% 15.96/2.43
% 15.96/2.43 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------