%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL516+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 : n026.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:05 AM UTC 2026
% Result : Theorem 12.00s 1.94s
% Output : CNFRefutation 12.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 15
% Syntax : Number of formulae : 86 ( 49 unt; 0 def)
% Number of atoms : 140 ( 9 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 100 ( 46 ~; 38 |; 7 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 131 ( 15 sgn 28 !; 4 ?)
% 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_1,axiom,
( or_1
<=> ! [X,Y] : is_a_theorem(implies(X,or(X,Y))) ),
file('theBenchmark.p',or_1) ).
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(cn2,axiom,
( cn2
<=> ! [P,Q] : is_a_theorem(implies(P,implies(not(P),Q))) ),
file('theBenchmark.p',cn2) ).
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(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_10,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(X,or(X,Y)))
| or_1 )
& ( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ) ),
inference(fof_nnf,[status(thm)],[or_1]) ).
fof(sk_or_1_sk,plain,
( ( ~ is_a_theorem(implies(sK0,or(sK0,sK1)))
| or_1 )
& ( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X,sK0),skolemize(Y,sK1)],[nnf_10]) ).
fof(sk_or_1,plain,
( ( ~ is_a_theorem(implies(sK0,or(sK0,sK1)))
| or_1 )
& ! [VAR_0,VAR_1] :
( is_a_theorem(implies(VAR_0,or(VAR_0,VAR_1)))
| ~ or_1 ) ),
inference(cnf_transformation,[status(thm)],[sk_or_1_sk]) ).
cnf(c_54,plain,
( is_a_theorem(implies(A,or(A,B)))
| ~ or_1 ),
inference(split_conjunct,[status(thm)],[sk_or_1]) ).
cnf(c_55,plain,
( ~ is_a_theorem(implies(sK0,or(sK0,sK1)))
| or_1 ),
inference(split_conjunct,[status(thm)],[sk_or_1]) ).
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]) ).
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(sK2,implies(not(sK2),sK3)))
| cn2 )
& ( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ cn2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(P,sK2),skolemize(Q,sK3)],[nnf_20]) ).
fof(sk_cn2,plain,
( ( ~ is_a_theorem(implies(sK2,implies(not(sK2),sK3)))
| 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(sK2,implies(not(sK2),sK3)))
| cn2 ),
inference(split_conjunct,[status(thm)],[sk_cn2]) ).
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_104,negated_conjecture,
~ cn2,
inference(clausify,[status(thm)],[luka_cn2_neg]) ).
cnf(c_105,plain,
not(and(not(A),not(B))) = or(A,B),
inference(resolve,[status(thm)],[c_95,c_89]) ).
cnf(c_106,plain,
not(and(A,not(B))) = implies(A,B),
inference(resolve,[status(thm)],[c_96,c_92]) ).
cnf(c_108,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_109,plain,
is_a_theorem(implies(A,and(A,A))),
inference(resolve,[status(thm)],[c_99,c_66]) ).
cnf(c_110,plain,
is_a_theorem(implies(and(A,B),A)),
inference(resolve,[status(thm)],[c_100,c_68]) ).
cnf(c_111,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_113,negated_conjecture,
~ is_a_theorem(implies(sK2,implies(not(sK2),sK3))),
inference(resolve,[status(thm)],[c_104,c_75]) ).
cnf(c_12497,plain,
implies(not(A),B) = or(A,B),
inference(paramod,[status(thm)],[c_106,c_105]) ).
cnf(c_114,plain,
or(A,B) = implies(not(A),B),
inference(copy,[status(thm)],[c_12497]) ).
cnf(c_132,plain,
( ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1)))
| or_1 ),
inference(paramod,[status(thm)],[c_114,c_55]) ).
cnf(c_133,plain,
( is_a_theorem(implies(A,implies(not(A),B)))
| ~ or_1 ),
inference(paramod,[status(thm)],[c_114,c_54]) ).
cnf(c_136,plain,
( is_a_theorem(B)
| ~ is_a_theorem(implies(implies(A,and(A,A)),B)) ),
inference(resolve,[status(thm)],[c_109,c_108]) ).
cnf(c_139,plain,
( is_a_theorem(C)
| ~ is_a_theorem(implies(implies(and(A,B),A),C)) ),
inference(resolve,[status(thm)],[c_110,c_108]) ).
cnf(c_142,plain,
( is_a_theorem(implies(not(and(B,C)),not(and(C,A))))
| ~ is_a_theorem(implies(A,B)) ),
inference(resolve,[status(thm)],[c_111,c_108]) ).
cnf(c_144,plain,
is_a_theorem(implies(implies(A,B),implies(implies(B,C),not(and(not(C),A))))),
inference(paramod,[status(thm)],[c_106,c_111]) ).
cnf(c_145,plain,
is_a_theorem(implies(implies(not(A),B),implies(not(and(B,C)),implies(C,A)))),
inference(paramod,[status(thm)],[c_106,c_111]) ).
cnf(c_152,plain,
~ or_1,
inference(resolve,[status(thm)],[c_133,c_113]) ).
cnf(c_153,plain,
~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))),
inference(resolve,[status(thm)],[c_152,c_132]) ).
cnf(c_188,plain,
is_a_theorem(implies(not(and(and(A,A),B)),not(and(B,A)))),
inference(resolve,[status(thm)],[c_136,c_111]) ).
cnf(c_296,plain,
is_a_theorem(implies(implies(and(A,A),B),not(and(not(B),A)))),
inference(paramod,[status(thm)],[c_106,c_188]) ).
cnf(c_436,plain,
is_a_theorem(not(and(not(A),A))),
inference(resolve,[status(thm)],[c_296,c_139]) ).
cnf(c_12498,plain,
( is_a_theorem(B)
| ~ is_a_theorem(implies(not(and(not(A),A)),B)) ),
inference(resolve,[status(thm)],[c_108,c_436]) ).
cnf(c_476,plain,
~ is_a_theorem(implies(not(and(not(A),A)),implies(sK0,implies(not(sK0),sK1)))),
inference(resolve,[status(thm)],[c_12498,c_153]) ).
cnf(c_480,plain,
is_a_theorem(implies(not(not(A)),A)),
inference(paramod,[status(thm)],[c_106,c_436]) ).
cnf(c_12499,plain,
is_a_theorem(implies(not(and(A,B)),not(and(B,not(not(A)))))),
inference(resolve,[status(thm)],[c_480,c_142]) ).
cnf(c_588,plain,
is_a_theorem(implies(not(and(A,B)),implies(B,not(A)))),
inference(paramod,[status(thm)],[c_106,c_12499]) ).
cnf(c_590,plain,
( is_a_theorem(A)
| ~ is_a_theorem(not(not(A))) ),
inference(resolve,[status(thm)],[c_480,c_108]) ).
cnf(c_682,plain,
is_a_theorem(implies(implies(A,B),implies(not(B),not(A)))),
inference(paramod,[status(thm)],[c_106,c_588]) ).
cnf(c_886,plain,
is_a_theorem(implies(not(A),not(and(A,B)))),
inference(resolve,[status(thm)],[c_682,c_139]) ).
cnf(c_887,plain,
is_a_theorem(implies(not(and(A,A)),not(A))),
inference(resolve,[status(thm)],[c_682,c_136]) ).
cnf(c_12500,plain,
( is_a_theorem(implies(not(and(B,C)),implies(C,A)))
| ~ is_a_theorem(implies(not(A),B)) ),
inference(resolve,[status(thm)],[c_108,c_145]) ).
cnf(c_961,plain,
~ is_a_theorem(implies(not(implies(not(sK0),sK1)),not(sK0))),
inference(resolve,[status(thm)],[c_12500,c_476]) ).
cnf(c_1108,plain,
is_a_theorem(implies(not(A),implies(A,B))),
inference(paramod,[status(thm)],[c_106,c_886]) ).
cnf(c_1116,plain,
( is_a_theorem(C)
| ~ is_a_theorem(implies(implies(not(A),implies(A,B)),C)) ),
inference(resolve,[status(thm)],[c_1108,c_108]) ).
cnf(c_1444,plain,
is_a_theorem(implies(implies(not(A),A),not(not(A)))),
inference(paramod,[status(thm)],[c_106,c_887]) ).
cnf(c_2106,plain,
( is_a_theorem(not(not(A)))
| ~ is_a_theorem(implies(not(A),A)) ),
inference(resolve,[status(thm)],[c_1444,c_108]) ).
cnf(c_12501,plain,
is_a_theorem(implies(implies(implies(A,B),C),not(and(not(C),not(A))))),
inference(resolve,[status(thm)],[c_1116,c_144]) ).
cnf(c_3533,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(not(C),A))),
inference(paramod,[status(thm)],[c_106,c_12501]) ).
cnf(c_5345,plain,
( is_a_theorem(implies(not(C),A))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_3533,c_108]) ).
cnf(c_12502,plain,
( is_a_theorem(implies(not(C),A))
| ~ is_a_theorem(implies(implies(A,B),C)) ),
inference(resolve,[status(thm)],[c_108,c_3533]) ).
cnf(c_5349,plain,
~ is_a_theorem(implies(implies(not(sK0),A),implies(not(sK0),sK1))),
inference(resolve,[status(thm)],[c_12502,c_961]) ).
cnf(c_5619,plain,
is_a_theorem(implies(not(implies(not(A),B)),implies(B,C))),
inference(resolve,[status(thm)],[c_5345,c_3533]) ).
cnf(c_12170,plain,
is_a_theorem(not(not(implies(not(A),not(A))))),
inference(resolve,[status(thm)],[c_5619,c_2106]) ).
cnf(c_12254,plain,
is_a_theorem(implies(not(A),not(A))),
inference(resolve,[status(thm)],[c_12170,c_590]) ).
cnf(c_12503,plain,
is_a_theorem(implies(implies(A,B),not(and(A,not(B))))),
inference(paramod,[status(thm)],[c_106,c_12254]) ).
cnf(c_12495,plain,
is_a_theorem(implies(implies(A,B),implies(A,B))),
inference(paramod,[status(thm)],[c_106,c_12503]) ).
cnf(c_12496,plain,
$false,
inference(resolve,[status(thm)],[c_12495,c_5349]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL516+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 : n026.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:44:09 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 3651782 was started by sandbox2 on n026,
% 0.10/0.37 % Fri Sep 25 22:44:09 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.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 12.00/1.94
% 12.00/1.94 % Assigning unary symbol not kb_weight 0 and highest precedence (94).
% 12.00/1.94
% 12.00/1.94 % SZS status Theorem for theBenchmark
% 12.00/1.94
% 12.00/1.94 % Proof 1 at 1.17 (+ 0.35) seconds.
% 12.00/1.94 % Length of proof is 66.
% 12.00/1.94 % Level of proof is 19.
% 12.00/1.94 % Maximum clause weight is 50.000.
% 12.00/1.94 % Given clauses 344.
% 12.00/1.94
% 12.00/1.94 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------