%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL192-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 : n017.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 4.71s 1.10s
% Output : CNFRefutation 4.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 21 unt; 0 def)
% Number of atoms : 41 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 16 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 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 : 64 ( 0 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_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]) ).
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(or(or(p,q),r),or(p,or(q,r)))),
file('theBenchmark.p',prove_this) ).
cnf(c_12,plain,
~ theorem(implies(or(or(p,q),r),or(p,or(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_5195,plain,
( ~ theorem(implies(B,C))
| theorem(implies(or(A,B),or(A,C))) ),
inference(resolve,[status(thm)],[c_13,c_11]) ).
cnf(c_16,plain,
theorem(implies(or(A,or(B,or(C,D))),or(A,or(C,or(B,D))))),
inference(resolve,[status(thm)],[c_5195,c_10]) ).
cnf(c_5196,plain,
( ~ theorem(implies(B,C))
| theorem(implies(or(A,B),or(A,C))) ),
inference(resolve,[status(thm)],[c_13,c_11]) ).
cnf(c_17,plain,
theorem(implies(or(A,or(B,C)),or(A,or(C,B)))),
inference(resolve,[status(thm)],[c_5196,c_9]) ).
cnf(c_33,plain,
theorem(or(not(or(A,B)),or(B,A))),
inference(paramod,[status(thm)],[c_14,c_9]) ).
cnf(c_38,plain,
~ theorem(or(not(or(or(p,q),r)),or(p,or(q,r)))),
inference(paramod,[status(thm)],[c_14,c_12]) ).
cnf(c_5197,plain,
( ~ theorem(implies(B,C))
| theorem(implies(or(A,B),or(A,C))) ),
inference(resolve,[status(thm)],[c_13,c_11]) ).
cnf(c_49,plain,
theorem(implies(or(A,or(B,or(C,D))),or(A,or(B,or(D,C))))),
inference(resolve,[status(thm)],[c_5197,c_17]) ).
cnf(c_5198,plain,
( ~ theorem(or(A,or(C,or(B,D))))
| theorem(or(A,or(B,or(C,D)))) ),
inference(resolve,[status(thm)],[c_13,c_16]) ).
cnf(c_1355,plain,
theorem(or(not(or(or(A,B),C)),or(A,or(C,B)))),
inference(resolve,[status(thm)],[c_5198,c_33]) ).
cnf(c_5199,plain,
( ~ theorem(A)
| ~ theorem(implies(A,or(not(or(or(p,q),r)),or(p,or(q,r))))) ),
inference(resolve,[status(thm)],[c_13,c_38]) ).
cnf(c_5200,plain,
~ theorem(or(not(or(or(p,q),r)),or(p,or(r,q)))),
inference(resolve,[status(thm)],[c_5199,c_49]) ).
cnf(c_5194,plain,
$false,
inference(resolve,[status(thm)],[c_1355,c_5200]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL192-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.42 % Computer : n017.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Fri Sep 25 21:55:03 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.16/0.42 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.42 % Process 3287129 was started by sandbox2 on n017,
% 0.16/0.42 % Fri Sep 25 21:55:03 2026
% 0.16/0.42 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.16/0.43
% 0.16/0.43 % From the command line: assign(max_seconds, 300).
% 4.71/1.10
% 4.71/1.10 % SZS status Unsatisfiable for theBenchmark
% 4.71/1.10
% 4.71/1.10 % Proof 1 at 0.46 (+ 0.20) seconds.
% 4.71/1.10 % Length of proof is 17.
% 4.71/1.10 % Level of proof is 4.
% 4.71/1.10 % Maximum clause weight is 41.000.
% 4.71/1.10 % Given clauses 139.
% 4.71/1.10
% 4.71/1.10 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------