%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL176-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.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:10 AM UTC 2026
% Result : Unsatisfiable 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 9 unt; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 9 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 19 ( 2 sgn 7 !; 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_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_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_19,plain,
theorem(or(not(or(A,A)),A)),
inference(resolve,[status(thm)],[c_1,c_6]) ).
fof(prove_this,axiom,
~ theorem(or(not(p),p)),
file('theBenchmark.p',prove_this) ).
cnf(c_24,plain,
~ theorem(or(not(p),p)),
inference(clausify,[status(thm)],[prove_this]) ).
cnf(c_30,plain,
theorem(or(not(A),A)),
inference(resolve,[status(thm)],[c_10,c_19]) ).
cnf(c_31,plain,
$false,
inference(resolve,[status(thm)],[c_30,c_24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL176-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 % Computer : n020.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Fri Sep 25 21:58:18 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.45 % Process 3899138 was started by sandbox on n020,
% 0.18/0.45 % Fri Sep 25 21:58:18 2026
% 0.18/0.45 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.18/0.46
% 0.18/0.46 % From the command line: assign(max_seconds, 300).
% 0.18/0.46
% 0.18/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.46
% 0.18/0.46 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.18/0.46 % Length of proof is 9.
% 0.18/0.46 % Level of proof is 3.
% 0.18/0.46 % Maximum clause weight is 12.000.
% 0.18/0.46 % Given clauses 11.
% 0.18/0.46
% 0.18/0.46 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------