%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL322-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 : n004.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:36 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 31 unt; 0 def)
% Number of atoms : 56 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 26 ~; 14 |; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 73 ( 4 sgn 15 !; 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(or(implies(p,q),implies(q,p))),
file('theBenchmark.p',prove_this) ).
cnf(c_12,plain,
~ theorem(or(implies(p,q),implies(q,p))),
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_127,plain,
~ theorem(or(or(not(p),q),implies(q,p))),
inference(paramod,[status(thm)],[c_14,c_12]) ).
cnf(c_16,plain,
~ theorem(or(or(not(p),q),or(not(q),p))),
inference(paramod,[status(thm)],[c_14,c_127]) ).
cnf(c_128,plain,
theorem(implies(or(not(A),B),implies(or(C,A),or(C,B)))),
inference(paramod,[status(thm)],[c_14,c_11]) ).
cnf(c_129,plain,
theorem(implies(or(not(A),B),or(not(or(C,A)),or(C,B)))),
inference(paramod,[status(thm)],[c_14,c_128]) ).
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_129]) ).
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_19,plain,
theorem(or(not(or(A,B)),or(B,A))),
inference(paramod,[status(thm)],[c_14,c_9]) ).
cnf(c_20,plain,
theorem(or(not(A),or(B,A))),
inference(paramod,[status(thm)],[c_14,c_8]) ).
cnf(c_130,plain,
( ~ theorem(A)
| ~ theorem(or(not(A),or(or(not(p),q),or(not(q),p)))) ),
inference(resolve,[status(thm)],[c_15,c_16]) ).
cnf(c_22,plain,
~ theorem(or(not(q),or(or(not(p),q),p))),
inference(resolve,[status(thm)],[c_130,c_18]) ).
cnf(c_131,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_25,plain,
theorem(or(not(or(A,or(B,C))),or(A,or(C,B)))),
inference(resolve,[status(thm)],[c_131,c_19]) ).
cnf(c_132,plain,
( ~ theorem(A)
| ~ theorem(or(not(A),or(not(q),or(or(not(p),q),p)))) ),
inference(resolve,[status(thm)],[c_15,c_22]) ).
cnf(c_38,plain,
~ theorem(or(or(not(p),q),p)),
inference(resolve,[status(thm)],[c_132,c_20]) ).
cnf(c_133,plain,
( ~ theorem(or(A,or(C,B)))
| theorem(or(A,or(B,C))) ),
inference(resolve,[status(thm)],[c_15,c_25]) ).
cnf(c_108,plain,
theorem(or(not(A),or(A,B))),
inference(resolve,[status(thm)],[c_133,c_20]) ).
cnf(c_134,plain,
( ~ theorem(A)
| ~ theorem(or(not(A),or(or(not(p),q),p))) ),
inference(resolve,[status(thm)],[c_15,c_38]) ).
cnf(c_121,plain,
~ theorem(or(p,or(not(p),q))),
inference(resolve,[status(thm)],[c_134,c_19]) ).
cnf(c_135,plain,
( ~ theorem(A)
| ~ theorem(or(not(A),or(p,or(not(p),q)))) ),
inference(resolve,[status(thm)],[c_15,c_121]) ).
cnf(c_125,plain,
~ theorem(or(not(p),or(p,q))),
inference(resolve,[status(thm)],[c_135,c_18]) ).
cnf(c_126,plain,
$false,
inference(resolve,[status(thm)],[c_125,c_108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL322-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 22:15:21 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 114189 was started by sandbox2 on n004,
% 0.10/0.37 % Fri Sep 25 22:15:21 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.37
% 0.10/0.37 % From the command line: assign(max_seconds, 300).
% 0.14/0.42
% 0.14/0.42 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.42
% 0.14/0.42 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.14/0.42 % Length of proof is 25.
% 0.14/0.42 % Level of proof is 7.
% 0.14/0.42 % Maximum clause weight is 29.000.
% 0.14/0.42 % Given clauses 24.
% 0.14/0.42
% 0.14/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------