%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL274-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:32 AM UTC 2026
% Result : Unsatisfiable 0.55s 0.59s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 25 unt; 0 def)
% Number of atoms : 46 ( 6 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 : 9 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 14 !; 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_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]) ).
fof(prove_this,axiom,
~ theorem(equivalent(or(p,q),or(q,p))),
file('theBenchmark.p',prove_this) ).
cnf(c_12,plain,
~ theorem(equivalent(or(p,q),or(q,p))),
inference(clausify,[status(thm)],[prove_this]) ).
fof(equivalent_defn,axiom,
! [VAR_0,VAR_1] : equivalent(VAR_0,VAR_1) = and(implies(VAR_0,VAR_1),implies(VAR_1,VAR_0)),
file('theBenchmark.p',equivalent_defn) ).
cnf(c_13,plain,
equivalent(A,B) = and(implies(A,B),implies(B,A)),
inference(clausify,[status(thm)],[equivalent_defn]) ).
fof(and_defn,axiom,
! [VAR_0,VAR_1] : and(VAR_0,VAR_1) = not(or(not(VAR_0),not(VAR_1))),
file('theBenchmark.p',and_defn) ).
cnf(c_14,plain,
and(A,B) = not(or(not(A),not(B))),
inference(clausify,[status(thm)],[and_defn]) ).
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_15,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_16,plain,
implies(A,B) = or(not(A),B),
inference(clausify,[status(thm)],[implies_definition]) ).
cnf(c_748,plain,
~ theorem(and(implies(or(p,q),or(q,p)),implies(or(q,p),or(p,q)))),
inference(paramod,[status(thm)],[c_13,c_12]) ).
cnf(c_749,plain,
~ theorem(and(or(not(or(p,q)),or(q,p)),implies(or(q,p),or(p,q)))),
inference(paramod,[status(thm)],[c_16,c_748]) ).
cnf(c_750,plain,
~ theorem(and(or(not(or(p,q)),or(q,p)),or(not(or(q,p)),or(p,q)))),
inference(paramod,[status(thm)],[c_16,c_749]) ).
cnf(c_17,plain,
~ theorem(not(or(not(or(not(or(p,q)),or(q,p))),not(or(not(or(q,p)),or(p,q)))))),
inference(paramod,[status(thm)],[c_14,c_750]) ).
cnf(c_19,plain,
( ~ theorem(B)
| ~ theorem(or(not(B),A))
| theorem(A) ),
inference(paramod,[status(thm)],[c_16,c_15]) ).
cnf(c_21,plain,
theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))),
inference(paramod,[status(thm)],[c_16,c_10]) ).
cnf(c_22,plain,
theorem(or(not(or(A,B)),or(B,A))),
inference(paramod,[status(thm)],[c_16,c_9]) ).
cnf(c_751,plain,
( ~ theorem(or(B,or(A,C)))
| theorem(or(A,or(B,C))) ),
inference(resolve,[status(thm)],[c_19,c_21]) ).
cnf(c_32,plain,
theorem(or(A,or(not(or(B,A)),B))),
inference(resolve,[status(thm)],[c_751,c_22]) ).
cnf(c_752,plain,
( ~ theorem(A)
| ~ theorem(or(not(A),not(or(not(or(not(or(p,q)),or(q,p))),not(or(not(or(q,p)),or(p,q))))))) ),
inference(resolve,[status(thm)],[c_19,c_17]) ).
cnf(c_36,plain,
~ theorem(or(not(or(not(or(A,B)),or(B,A))),not(or(not(or(not(or(p,q)),or(q,p))),not(or(not(or(q,p)),or(p,q))))))),
inference(resolve,[status(thm)],[c_752,c_22]) ).
cnf(c_753,plain,
( ~ theorem(B)
| theorem(or(not(or(A,not(B))),A)) ),
inference(resolve,[status(thm)],[c_19,c_32]) ).
cnf(c_384,plain,
theorem(or(not(or(A,not(or(not(or(B,C)),or(C,B))))),A)),
inference(resolve,[status(thm)],[c_753,c_22]) ).
cnf(c_754,plain,
( ~ theorem(A)
| ~ theorem(or(not(A),or(not(or(not(or(B,C)),or(C,B))),not(or(not(or(not(or(p,q)),or(q,p))),not(or(not(or(q,p)),or(p,q)))))))) ),
inference(resolve,[status(thm)],[c_19,c_36]) ).
cnf(c_746,plain,
~ theorem(or(not(or(not(or(not(or(p,q)),or(q,p))),not(or(not(or(q,p)),or(p,q))))),not(or(not(or(A,B)),or(B,A))))),
inference(resolve,[status(thm)],[c_754,c_22]) ).
cnf(c_747,plain,
$false,
inference(resolve,[status(thm)],[c_746,c_384]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL274-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.15/0.42 % Computer : n004.cluster.edu
% 0.15/0.42 % Model : x86_64 x86_64
% 0.15/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42 % Memory : 8046.5625MB
% 0.15/0.42 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Fri Sep 25 22:10:06 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/0.42 % Process 98682 was started by sandbox2 on n004,
% 0.15/0.42 % Fri Sep 25 22:10:06 2026
% 0.15/0.42 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.15/0.43
% 0.15/0.43 % From the command line: assign(max_seconds, 300).
% 0.55/0.59
% 0.55/0.59 % SZS status Unsatisfiable for theBenchmark
% 0.55/0.59
% 0.55/0.59 % Proof 1 at 0.11 (+ 0.04) seconds.
% 0.55/0.59 % Length of proof is 19.
% 0.55/0.59 % Level of proof is 5.
% 0.55/0.59 % Maximum clause weight is 86.000.
% 0.55/0.59 % Given clauses 51.
% 0.55/0.59
% 0.55/0.59 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------