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