%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL497+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/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:59:03 AM UTC 2026
% Result : Theorem 3.98s 0.95s
% Output : CNFRefutation 3.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 65 ( 37 unt; 0 def)
% Number of atoms : 104 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 71 ( 32 ~; 26 |; 4 &)
% ( 7 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 92 ( 10 sgn 23 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X,Y] :
( ( is_a_theorem(implies(X,Y))
& is_a_theorem(X) )
=> is_a_theorem(Y) ) ),
file('theBenchmark.p',modus_ponens) ).
fof(cn2,axiom,
( cn2
<=> ! [P,Q] : is_a_theorem(implies(P,implies(not(P),Q))) ),
file('theBenchmark.p',cn2) ).
fof(r1,axiom,
( r1
<=> ! [P] : is_a_theorem(implies(or(P,P),P)) ),
file('theBenchmark.p',r1) ).
fof(r2,axiom,
( r2
<=> ! [P,Q] : is_a_theorem(implies(Q,or(P,Q))) ),
file('theBenchmark.p',r2) ).
fof(r3,axiom,
( r3
<=> ! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P))) ),
file('theBenchmark.p',r3) ).
fof(r4,axiom,
( r4
<=> ! [P,Q,R] : is_a_theorem(implies(or(P,or(Q,R)),or(Q,or(P,R)))) ),
file('theBenchmark.p',r4) ).
fof(r5,axiom,
( r5
<=> ! [P,Q,R] : is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R)))) ),
file('theBenchmark.p',r5) ).
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X,Y] : implies(X,Y) = or(not(X),Y) ),
file('theBenchmark.p',op_implies_or) ).
fof(luka_cn2,conjecture,
cn2,
file('theBenchmark.p',luka_cn2) ).
fof(luka_cn2_neg,negated_conjecture,
~ cn2,
inference(assume_negation,[status(cth)],[luka_cn2]) ).
cnf(c_33,plain,
( is_a_theorem(B)
| ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| ~ modus_ponens ),
inference(clausify,[status(thm)],[modus_ponens]) ).
fof(nnf_20,plain,
( ( ? [P,Q] : ~ is_a_theorem(implies(P,implies(not(P),Q)))
| cn2 )
& ( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ cn2 ) ),
inference(fof_nnf,[status(thm)],[cn2]) ).
fof(sk_cn2_sk,plain,
( ( ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1)))
| cn2 )
& ( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ cn2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(P,sK0),skolemize(Q,sK1)],[nnf_20]) ).
fof(sk_cn2,plain,
( ( ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1)))
| cn2 )
& ! [VAR_0,VAR_1] :
( is_a_theorem(implies(VAR_0,implies(not(VAR_0),VAR_1)))
| ~ cn2 ) ),
inference(cnf_transformation,[status(thm)],[sk_cn2_sk]) ).
cnf(c_75,plain,
( ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1)))
| cn2 ),
inference(split_conjunct,[status(thm)],[sk_cn2]) ).
cnf(c_78,plain,
( is_a_theorem(implies(or(A,A),A))
| ~ r1 ),
inference(clausify,[status(thm)],[r1]) ).
cnf(c_80,plain,
( is_a_theorem(implies(A,or(B,A)))
| ~ r2 ),
inference(clausify,[status(thm)],[r2]) ).
cnf(c_82,plain,
( is_a_theorem(implies(or(A,B),or(B,A)))
| ~ r3 ),
inference(clausify,[status(thm)],[r3]) ).
cnf(c_84,plain,
( is_a_theorem(implies(or(A,or(B,C)),or(B,or(A,C))))
| ~ r4 ),
inference(clausify,[status(thm)],[r4]) ).
cnf(c_86,plain,
( is_a_theorem(implies(implies(A,B),implies(or(C,A),or(C,B))))
| ~ r5 ),
inference(clausify,[status(thm)],[r5]) ).
cnf(c_93,plain,
( or(not(A),B) = implies(A,B)
| ~ op_implies_or ),
inference(clausify,[status(thm)],[op_implies_or]) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('theBenchmark.p',principia_op_implies_or) ).
cnf(c_96,plain,
op_implies_or,
inference(clausify,[status(thm)],[principia_op_implies_or]) ).
fof(principia_modus_ponens,axiom,
modus_ponens,
file('theBenchmark.p',principia_modus_ponens) ).
cnf(c_99,plain,
modus_ponens,
inference(clausify,[status(thm)],[principia_modus_ponens]) ).
fof(principia_r1,axiom,
r1,
file('theBenchmark.p',principia_r1) ).
cnf(c_100,plain,
r1,
inference(clausify,[status(thm)],[principia_r1]) ).
fof(principia_r2,axiom,
r2,
file('theBenchmark.p',principia_r2) ).
cnf(c_101,plain,
r2,
inference(clausify,[status(thm)],[principia_r2]) ).
fof(principia_r3,axiom,
r3,
file('theBenchmark.p',principia_r3) ).
cnf(c_102,plain,
r3,
inference(clausify,[status(thm)],[principia_r3]) ).
fof(principia_r4,axiom,
r4,
file('theBenchmark.p',principia_r4) ).
cnf(c_103,plain,
r4,
inference(clausify,[status(thm)],[principia_r4]) ).
fof(principia_r5,axiom,
r5,
file('theBenchmark.p',principia_r5) ).
cnf(c_104,plain,
r5,
inference(clausify,[status(thm)],[principia_r5]) ).
cnf(c_108,negated_conjecture,
~ cn2,
inference(clausify,[status(thm)],[luka_cn2_neg]) ).
cnf(c_109,plain,
or(not(A),B) = implies(A,B),
inference(resolve,[status(thm)],[c_96,c_93]) ).
cnf(c_112,plain,
( is_a_theorem(B)
| ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_99,c_33]) ).
cnf(c_113,plain,
is_a_theorem(implies(or(A,A),A)),
inference(resolve,[status(thm)],[c_100,c_78]) ).
cnf(c_114,plain,
is_a_theorem(implies(A,or(B,A))),
inference(resolve,[status(thm)],[c_101,c_80]) ).
cnf(c_115,plain,
is_a_theorem(implies(or(A,B),or(B,A))),
inference(resolve,[status(thm)],[c_102,c_82]) ).
cnf(c_116,plain,
is_a_theorem(implies(or(A,or(B,C)),or(B,or(A,C)))),
inference(resolve,[status(thm)],[c_103,c_84]) ).
cnf(c_117,plain,
is_a_theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))),
inference(resolve,[status(thm)],[c_104,c_86]) ).
cnf(c_120,negated_conjecture,
~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))),
inference(resolve,[status(thm)],[c_108,c_75]) ).
cnf(c_129,plain,
( is_a_theorem(A)
| ~ is_a_theorem(or(A,A)) ),
inference(resolve,[status(thm)],[c_113,c_112]) ).
cnf(c_131,plain,
( is_a_theorem(or(B,A))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_114,c_112]) ).
cnf(c_134,plain,
( is_a_theorem(or(B,A))
| ~ is_a_theorem(or(A,B)) ),
inference(resolve,[status(thm)],[c_115,c_112]) ).
cnf(c_136,plain,
is_a_theorem(implies(or(A,not(B)),implies(B,A))),
inference(paramod,[status(thm)],[c_109,c_115]) ).
cnf(c_137,plain,
( is_a_theorem(or(B,or(A,C)))
| ~ is_a_theorem(or(A,or(B,C))) ),
inference(resolve,[status(thm)],[c_116,c_112]) ).
cnf(c_142,plain,
( is_a_theorem(implies(or(C,A),or(C,B)))
| ~ is_a_theorem(implies(A,B)) ),
inference(resolve,[status(thm)],[c_117,c_112]) ).
cnf(c_230,plain,
( is_a_theorem(or(B,not(A)))
| ~ is_a_theorem(implies(A,B)) ),
inference(paramod,[status(thm)],[c_109,c_134]) ).
cnf(c_426,plain,
is_a_theorem(or(or(A,B),not(B))),
inference(resolve,[status(thm)],[c_230,c_114]) ).
cnf(c_453,plain,
is_a_theorem(or(not(A),or(B,A))),
inference(resolve,[status(thm)],[c_426,c_134]) ).
cnf(c_642,plain,
is_a_theorem(or(A,or(not(B),B))),
inference(resolve,[status(thm)],[c_137,c_453]) ).
cnf(c_686,plain,
is_a_theorem(or(not(A),A)),
inference(resolve,[status(thm)],[c_642,c_129]) ).
cnf(c_747,plain,
is_a_theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))),
inference(resolve,[status(thm)],[c_136,c_142]) ).
cnf(c_6817,plain,
( is_a_theorem(implies(B,A))
| ~ is_a_theorem(or(A,not(B))) ),
inference(resolve,[status(thm)],[c_112,c_136]) ).
cnf(c_760,plain,
~ is_a_theorem(or(implies(not(sK0),sK1),not(sK0))),
inference(resolve,[status(thm)],[c_6817,c_120]) ).
cnf(c_868,plain,
is_a_theorem(or(A,not(A))),
inference(resolve,[status(thm)],[c_686,c_134]) ).
cnf(c_925,plain,
is_a_theorem(or(A,or(B,not(B)))),
inference(resolve,[status(thm)],[c_868,c_131]) ).
cnf(c_2324,plain,
is_a_theorem(or(A,or(B,not(A)))),
inference(resolve,[status(thm)],[c_925,c_137]) ).
cnf(c_3314,plain,
~ is_a_theorem(or(not(sK0),implies(not(sK0),sK1))),
inference(resolve,[status(thm)],[c_134,c_760]) ).
cnf(c_6818,plain,
( is_a_theorem(C)
| ~ is_a_theorem(implies(or(A,or(B,not(A))),C)) ),
inference(resolve,[status(thm)],[c_112,c_2324]) ).
cnf(c_6815,plain,
~ is_a_theorem(implies(or(A,or(B,not(A))),or(not(sK0),implies(not(sK0),sK1)))),
inference(resolve,[status(thm)],[c_6818,c_3314]) ).
cnf(c_6816,plain,
$false,
inference(resolve,[status(thm)],[c_6815,c_747]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL497+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n020.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:40:33 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 3992854 was started by sandbox2 on n020,
% 0.10/0.37 % Fri Sep 25 22:40:33 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.39
% 0.10/0.39 % From the command line: assign(max_seconds, 300).
% 3.98/0.95
% 3.98/0.95 % SZS status Theorem for theBenchmark
% 3.98/0.95
% 3.98/0.95 % Proof 1 at 0.43 (+ 0.12) seconds.
% 3.98/0.95 % Length of proof is 52.
% 3.98/0.95 % Level of proof is 13.
% 3.98/0.95 % Maximum clause weight is 40.000.
% 3.98/0.95 % Given clauses 229.
% 3.98/0.95
% 3.98/0.95 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------