%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL510+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/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:59:04 AM UTC 2026
% Result : Theorem 25.67s 6.78s
% Output : CNFRefutation 25.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 14
% Syntax : Number of formulae : 75 ( 47 unt; 0 def)
% Number of atoms : 114 ( 9 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 71 ( 32 ~; 27 |; 4 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 115 ( 13 sgn 20 !; 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(or_2,axiom,
( or_2
<=> ! [X,Y] : is_a_theorem(implies(Y,or(X,Y))) ),
file('theBenchmark.p',or_2) ).
fof(kn1,axiom,
( kn1
<=> ! [P] : is_a_theorem(implies(P,and(P,P))) ),
file('theBenchmark.p',kn1) ).
fof(kn2,axiom,
( kn2
<=> ! [P,Q] : is_a_theorem(implies(and(P,Q),P)) ),
file('theBenchmark.p',kn2) ).
fof(kn3,axiom,
( kn3
<=> ! [P,Q,R] : is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P))))) ),
file('theBenchmark.p',kn3) ).
fof(op_or,axiom,
( op_or
=> ! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) ),
file('theBenchmark.p',op_or) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X,Y] : implies(X,Y) = not(and(X,not(Y))) ),
file('theBenchmark.p',op_implies_and) ).
fof(hilbert_or_2,conjecture,
or_2,
file('theBenchmark.p',hilbert_or_2) ).
fof(hilbert_or_2_neg,negated_conjecture,
~ or_2,
inference(assume_negation,[status(cth)],[hilbert_or_2]) ).
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_11,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(Y,or(X,Y)))
| or_2 )
& ( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ or_2 ) ),
inference(fof_nnf,[status(thm)],[or_2]) ).
fof(sk_or_2_sk,plain,
( ( ~ is_a_theorem(implies(sK0,or(sK1,sK0)))
| or_2 )
& ( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ or_2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X,sK1),skolemize(Y,sK0)],[nnf_11]) ).
fof(sk_or_2,plain,
( ( ~ is_a_theorem(implies(sK0,or(sK1,sK0)))
| or_2 )
& ! [VAR_0,VAR_1] :
( is_a_theorem(implies(VAR_0,or(VAR_1,VAR_0)))
| ~ or_2 ) ),
inference(cnf_transformation,[status(thm)],[sk_or_2_sk]) ).
cnf(c_57,plain,
( ~ is_a_theorem(implies(sK0,or(sK1,sK0)))
| or_2 ),
inference(split_conjunct,[status(thm)],[sk_or_2]) ).
cnf(c_66,plain,
( is_a_theorem(implies(A,and(A,A)))
| ~ kn1 ),
inference(clausify,[status(thm)],[kn1]) ).
cnf(c_68,plain,
( is_a_theorem(implies(and(A,B),A))
| ~ kn2 ),
inference(clausify,[status(thm)],[kn2]) ).
cnf(c_70,plain,
( is_a_theorem(implies(implies(A,B),implies(not(and(B,C)),not(and(C,A)))))
| ~ kn3 ),
inference(clausify,[status(thm)],[kn3]) ).
cnf(c_88,plain,
( or(A,B) = not(and(not(A),not(B)))
| ~ op_or ),
inference(clausify,[status(thm)],[op_or]) ).
cnf(c_89,plain,
( not(and(not(A),not(B))) = or(A,B)
| ~ op_or ),
inference(copy,[status(thm)],[c_88]) ).
cnf(c_92,plain,
( not(and(A,not(B))) = implies(A,B)
| ~ op_implies_and ),
inference(clausify,[status(thm)],[op_implies_and]) ).
fof(rosser_op_or,axiom,
op_or,
file('theBenchmark.p',rosser_op_or) ).
cnf(c_95,plain,
op_or,
inference(clausify,[status(thm)],[rosser_op_or]) ).
fof(rosser_op_implies_and,axiom,
op_implies_and,
file('theBenchmark.p',rosser_op_implies_and) ).
cnf(c_96,plain,
op_implies_and,
inference(clausify,[status(thm)],[rosser_op_implies_and]) ).
fof(rosser_modus_ponens,axiom,
modus_ponens,
file('theBenchmark.p',rosser_modus_ponens) ).
cnf(c_98,plain,
modus_ponens,
inference(clausify,[status(thm)],[rosser_modus_ponens]) ).
fof(rosser_kn1,axiom,
kn1,
file('theBenchmark.p',rosser_kn1) ).
cnf(c_99,plain,
kn1,
inference(clausify,[status(thm)],[rosser_kn1]) ).
fof(rosser_kn2,axiom,
kn2,
file('theBenchmark.p',rosser_kn2) ).
cnf(c_100,plain,
kn2,
inference(clausify,[status(thm)],[rosser_kn2]) ).
fof(rosser_kn3,axiom,
kn3,
file('theBenchmark.p',rosser_kn3) ).
cnf(c_101,plain,
kn3,
inference(clausify,[status(thm)],[rosser_kn3]) ).
cnf(c_103,negated_conjecture,
~ or_2,
inference(clausify,[status(thm)],[hilbert_or_2_neg]) ).
cnf(c_104,plain,
not(and(not(A),not(B))) = or(A,B),
inference(resolve,[status(thm)],[c_95,c_89]) ).
cnf(c_105,plain,
not(and(A,not(B))) = implies(A,B),
inference(resolve,[status(thm)],[c_96,c_92]) ).
cnf(c_107,plain,
( is_a_theorem(B)
| ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_98,c_33]) ).
cnf(c_108,plain,
is_a_theorem(implies(A,and(A,A))),
inference(resolve,[status(thm)],[c_99,c_66]) ).
cnf(c_109,plain,
is_a_theorem(implies(and(A,B),A)),
inference(resolve,[status(thm)],[c_100,c_68]) ).
cnf(c_110,plain,
is_a_theorem(implies(implies(A,B),implies(not(and(B,C)),not(and(C,A))))),
inference(resolve,[status(thm)],[c_101,c_70]) ).
cnf(c_112,negated_conjecture,
~ is_a_theorem(implies(sK0,or(sK1,sK0))),
inference(resolve,[status(thm)],[c_103,c_57]) ).
cnf(c_17475,plain,
implies(not(A),B) = or(A,B),
inference(paramod,[status(thm)],[c_105,c_104]) ).
cnf(c_113,plain,
or(A,B) = implies(not(A),B),
inference(copy,[status(thm)],[c_17475]) ).
cnf(c_115,negated_conjecture,
~ is_a_theorem(implies(sK0,implies(not(sK1),sK0))),
inference(paramod,[status(thm)],[c_113,c_112]) ).
cnf(c_134,plain,
( is_a_theorem(B)
| ~ is_a_theorem(implies(implies(A,and(A,A)),B)) ),
inference(resolve,[status(thm)],[c_108,c_107]) ).
cnf(c_137,plain,
( is_a_theorem(C)
| ~ is_a_theorem(implies(implies(and(A,B),A),C)) ),
inference(resolve,[status(thm)],[c_109,c_107]) ).
cnf(c_142,plain,
is_a_theorem(implies(implies(A,B),implies(implies(B,C),not(and(not(C),A))))),
inference(paramod,[status(thm)],[c_105,c_110]) ).
cnf(c_143,plain,
is_a_theorem(implies(implies(not(A),B),implies(not(and(B,C)),implies(C,A)))),
inference(paramod,[status(thm)],[c_105,c_110]) ).
cnf(c_183,plain,
is_a_theorem(implies(not(and(and(A,A),B)),not(and(B,A)))),
inference(resolve,[status(thm)],[c_134,c_110]) ).
cnf(c_295,plain,
is_a_theorem(implies(implies(and(A,A),B),not(and(not(B),A)))),
inference(paramod,[status(thm)],[c_105,c_183]) ).
cnf(c_451,plain,
( is_a_theorem(implies(not(and(B,C)),implies(C,A)))
| ~ is_a_theorem(implies(not(A),B)) ),
inference(resolve,[status(thm)],[c_143,c_107]) ).
cnf(c_558,plain,
is_a_theorem(not(and(not(A),A))),
inference(resolve,[status(thm)],[c_295,c_137]) ).
cnf(c_17476,plain,
( is_a_theorem(B)
| ~ is_a_theorem(implies(not(and(not(A),A)),B)) ),
inference(resolve,[status(thm)],[c_107,c_558]) ).
cnf(c_614,plain,
~ is_a_theorem(implies(not(and(not(A),A)),implies(sK0,implies(not(sK1),sK0)))),
inference(resolve,[status(thm)],[c_17476,c_115]) ).
cnf(c_616,plain,
is_a_theorem(implies(not(not(A)),A)),
inference(paramod,[status(thm)],[c_105,c_558]) ).
cnf(c_619,plain,
is_a_theorem(implies(not(and(A,B)),implies(B,not(A)))),
inference(resolve,[status(thm)],[c_616,c_451]) ).
cnf(c_621,plain,
( is_a_theorem(A)
| ~ is_a_theorem(not(not(A))) ),
inference(resolve,[status(thm)],[c_616,c_107]) ).
cnf(c_851,plain,
is_a_theorem(implies(implies(A,B),implies(not(B),not(A)))),
inference(paramod,[status(thm)],[c_105,c_619]) ).
cnf(c_1085,plain,
is_a_theorem(implies(not(A),not(and(A,B)))),
inference(resolve,[status(thm)],[c_851,c_137]) ).
cnf(c_1086,plain,
is_a_theorem(implies(not(and(A,A)),not(A))),
inference(resolve,[status(thm)],[c_851,c_134]) ).
cnf(c_1314,plain,
is_a_theorem(implies(not(A),implies(A,B))),
inference(paramod,[status(thm)],[c_105,c_1085]) ).
cnf(c_1322,plain,
( is_a_theorem(C)
| ~ is_a_theorem(implies(implies(not(A),implies(A,B)),C)) ),
inference(resolve,[status(thm)],[c_1314,c_107]) ).
cnf(c_1673,plain,
is_a_theorem(implies(implies(not(A),A),not(not(A)))),
inference(paramod,[status(thm)],[c_105,c_1086]) ).
cnf(c_2397,plain,
( is_a_theorem(not(not(A)))
| ~ is_a_theorem(implies(not(A),A)) ),
inference(resolve,[status(thm)],[c_1673,c_107]) ).
cnf(c_17477,plain,
is_a_theorem(implies(implies(implies(A,B),C),not(and(not(C),not(A))))),
inference(resolve,[status(thm)],[c_1322,c_142]) ).
cnf(c_3929,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(not(C),A))),
inference(paramod,[status(thm)],[c_105,c_17477]) ).
cnf(c_5853,plain,
( is_a_theorem(implies(not(C),A))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_3929,c_107]) ).
cnf(c_6149,plain,
is_a_theorem(implies(not(implies(not(A),B)),implies(B,C))),
inference(resolve,[status(thm)],[c_5853,c_3929]) ).
cnf(c_12588,plain,
is_a_theorem(not(not(implies(not(A),not(A))))),
inference(resolve,[status(thm)],[c_6149,c_2397]) ).
cnf(c_13069,plain,
is_a_theorem(implies(not(A),not(A))),
inference(resolve,[status(thm)],[c_12588,c_621]) ).
cnf(c_13188,plain,
( is_a_theorem(B)
| ~ is_a_theorem(implies(implies(not(A),not(A)),B)) ),
inference(resolve,[status(thm)],[c_13069,c_107]) ).
cnf(c_17478,plain,
is_a_theorem(implies(implies(not(A),B),not(and(not(B),not(A))))),
inference(resolve,[status(thm)],[c_13188,c_142]) ).
cnf(c_14761,plain,
is_a_theorem(implies(implies(not(A),B),implies(not(B),A))),
inference(paramod,[status(thm)],[c_105,c_17478]) ).
cnf(c_15287,plain,
is_a_theorem(implies(not(implies(not(A),B)),not(B))),
inference(resolve,[status(thm)],[c_14761,c_5853]) ).
cnf(c_17473,plain,
is_a_theorem(implies(not(and(not(A),B)),implies(B,implies(not(C),A)))),
inference(resolve,[status(thm)],[c_15287,c_451]) ).
cnf(c_17474,plain,
$false,
inference(resolve,[status(thm)],[c_17473,c_614]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL510+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.38 % Computer : n009.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Fri Sep 25 22:40:59 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.38 % Process 2751115 was started by sandbox on n009,
% 0.11/0.38 % Fri Sep 25 22:40:59 2026
% 0.11/0.38 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/0.39
% 0.11/0.39 % From the command line: assign(max_seconds, 300).
% 25.67/6.78
% 25.67/6.78 % Assigning unary symbol not kb_weight 0 and highest precedence (93).
% 25.67/6.78
% 25.67/6.78 % SZS status Theorem for theBenchmark
% 25.67/6.78
% 25.67/6.78 % Proof 1 at 2.45 (+ 0.70) seconds.
% 25.67/6.78 % Length of proof is 61.
% 25.67/6.78 % Level of proof is 22.
% 25.67/6.78 % Maximum clause weight is 50.000.
% 25.67/6.78 % Given clauses 462.
% 25.67/6.78
% 25.67/6.78 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------