%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL231-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 : n011.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.09s 0.44s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 29 unt; 0 def)
% Number of atoms : 50 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 22 ~; 12 |; 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; 3 con; 0-2 aty)
% Number of variables : 70 ( 4 sgn 13 !; 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_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_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(implies(implies(p,q),implies(p,r)),implies(p,implies(q,r)))),
file('theBenchmark.p',prove_this) ).
cnf(c_12,plain,
~ theorem(implies(implies(implies(p,q),implies(p,r)),implies(p,implies(q,r)))),
inference(clausify,[status(thm)],[prove_this]) ).
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_13,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_14,plain,
implies(A,B) = or(not(A),B),
inference(clausify,[status(thm)],[implies_definition]) ).
cnf(c_15,plain,
( ~ theorem(B)
| ~ theorem(or(not(B),A))
| theorem(A) ),
inference(paramod,[status(thm)],[c_14,c_13]) ).
cnf(c_206,plain,
~ theorem(implies(implies(or(not(p),q),implies(p,r)),implies(p,implies(q,r)))),
inference(paramod,[status(thm)],[c_14,c_12]) ).
cnf(c_207,plain,
~ theorem(implies(implies(or(not(p),q),or(not(p),r)),implies(p,implies(q,r)))),
inference(paramod,[status(thm)],[c_14,c_206]) ).
cnf(c_208,plain,
~ theorem(implies(or(not(or(not(p),q)),or(not(p),r)),implies(p,implies(q,r)))),
inference(paramod,[status(thm)],[c_14,c_207]) ).
cnf(c_209,plain,
~ theorem(implies(or(not(or(not(p),q)),or(not(p),r)),implies(p,or(not(q),r)))),
inference(paramod,[status(thm)],[c_14,c_208]) ).
cnf(c_210,plain,
~ theorem(implies(or(not(or(not(p),q)),or(not(p),r)),or(not(p),or(not(q),r)))),
inference(paramod,[status(thm)],[c_14,c_209]) ).
cnf(c_16,plain,
~ theorem(or(not(or(not(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r)))),
inference(paramod,[status(thm)],[c_14,c_210]) ).
cnf(c_211,plain,
theorem(implies(or(not(A),B),implies(or(C,A),or(C,B)))),
inference(paramod,[status(thm)],[c_14,c_11]) ).
cnf(c_212,plain,
theorem(implies(or(not(A),B),or(not(or(C,A)),or(C,B)))),
inference(paramod,[status(thm)],[c_14,c_211]) ).
cnf(c_17,plain,
theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
inference(paramod,[status(thm)],[c_14,c_212]) ).
cnf(c_18,plain,
theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))),
inference(paramod,[status(thm)],[c_14,c_10]) ).
cnf(c_20,plain,
theorem(or(not(A),or(B,A))),
inference(paramod,[status(thm)],[c_14,c_8]) ).
cnf(c_213,plain,
( ~ theorem(or(not(B),C))
| theorem(or(not(or(A,B)),or(A,C))) ),
inference(resolve,[status(thm)],[c_15,c_17]) ).
cnf(c_24,plain,
theorem(or(not(or(A,or(B,or(C,D)))),or(A,or(C,or(B,D))))),
inference(resolve,[status(thm)],[c_213,c_18]) ).
cnf(c_214,plain,
( ~ theorem(or(B,or(A,C)))
| theorem(or(A,or(B,C))) ),
inference(resolve,[status(thm)],[c_15,c_18]) ).
cnf(c_25,plain,
theorem(or(not(or(A,B)),or(not(or(not(B),C)),or(A,C)))),
inference(resolve,[status(thm)],[c_214,c_17]) ).
cnf(c_215,plain,
( ~ theorem(A)
| ~ theorem(or(not(A),or(not(or(not(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r))))) ),
inference(resolve,[status(thm)],[c_15,c_16]) ).
cnf(c_79,plain,
~ theorem(or(not(or(not(or(not(p),q)),or(not(p),r))),or(not(q),or(not(p),r)))),
inference(resolve,[status(thm)],[c_215,c_24]) ).
cnf(c_216,plain,
( ~ theorem(or(C,A))
| theorem(or(not(or(not(A),B)),or(C,B))) ),
inference(resolve,[status(thm)],[c_15,c_25]) ).
cnf(c_204,plain,
theorem(or(not(or(not(or(A,B)),C)),or(not(B),C))),
inference(resolve,[status(thm)],[c_216,c_20]) ).
cnf(c_205,plain,
$false,
inference(resolve,[status(thm)],[c_204,c_79]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL231-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.37 % Computer : n011.cluster.edu
% 0.07/0.37 % Model : x86_64 x86_64
% 0.07/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.37 % Memory : 8046.5625MB
% 0.07/0.37 % OS : Linux 6.8.0-71-generic
% 0.07/0.37 % CPULimit : 300
% 0.07/0.37 % WCLimit : 300
% 0.07/0.37 % DateTime : Fri Sep 25 22:04:58 UTC 2026
% 0.07/0.37 % CPUTime :
% 0.07/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.07/0.37 % Process 3030514 was started by sandbox on n011,
% 0.07/0.37 % Fri Sep 25 22:04:58 2026
% 0.07/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.38
% 0.09/0.38 % From the command line: assign(max_seconds, 300).
% 0.09/0.44
% 0.09/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.44
% 0.09/0.44 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.09/0.44 % Length of proof is 20.
% 0.09/0.44 % Level of proof is 5.
% 0.09/0.44 % Maximum clause weight is 72.000.
% 0.09/0.44 % Given clauses 22.
% 0.09/0.44
% 0.09/0.44 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------