%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : LCL548+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 : n001.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:08 AM UTC 2026
% Result : Theorem 110.87s 20.40s
% Output : CNFRefutation 110.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 34
% Syntax : Number of formulae : 129 ( 80 unt; 0 def)
% Number of atoms : 193 ( 35 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 108 ( 44 ~; 40 |; 4 &)
% ( 13 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 20 ( 18 usr; 18 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 145 ( 6 sgn 33 !; 1 ?)
% 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(substitution_of_equivalents,axiom,
( substitution_of_equivalents
<=> ! [X,Y] :
( is_a_theorem(equiv(X,Y))
=> X = Y ) ),
file('theBenchmark.p',substitution_of_equivalents) ).
fof(implies_1,axiom,
( implies_1
<=> ! [X,Y] : is_a_theorem(implies(X,implies(Y,X))) ),
file('theBenchmark.p',implies_1) ).
fof(implies_2,axiom,
( implies_2
<=> ! [X,Y] : is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))) ),
file('theBenchmark.p',implies_2) ).
fof(and_2,axiom,
( and_2
<=> ! [X,Y] : is_a_theorem(implies(and(X,Y),Y)) ),
file('theBenchmark.p',and_2) ).
fof(and_3,axiom,
( and_3
<=> ! [X,Y] : is_a_theorem(implies(X,implies(Y,and(X,Y)))) ),
file('theBenchmark.p',and_3) ).
fof(or_2,axiom,
( or_2
<=> ! [X,Y] : is_a_theorem(implies(Y,or(X,Y))) ),
file('theBenchmark.p',or_2) ).
fof(or_3,axiom,
( or_3
<=> ! [X,Y,Z] : is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z)))) ),
file('theBenchmark.p',or_3) ).
fof(equivalence_3,axiom,
( equivalence_3
<=> ! [X,Y] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y)))) ),
file('theBenchmark.p',equivalence_3) ).
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(necessitation,axiom,
( necessitation
<=> ! [X] :
( is_a_theorem(X)
=> is_a_theorem(necessarily(X)) ) ),
file('theBenchmark.p',necessitation) ).
fof(axiom_M,axiom,
( axiom_M
<=> ! [X] : is_a_theorem(implies(necessarily(X),X)) ),
file('theBenchmark.p',axiom_M) ).
fof(axiom_4,axiom,
( axiom_4
<=> ! [X] : is_a_theorem(implies(necessarily(X),necessarily(necessarily(X)))) ),
file('theBenchmark.p',axiom_4) ).
fof(axiom_m9,axiom,
( axiom_m9
<=> ! [X] : is_a_theorem(strict_implies(possibly(possibly(X)),possibly(X))) ),
file('theBenchmark.p',axiom_m9) ).
fof(op_possibly,axiom,
( op_possibly
=> ! [X] : possibly(X) = not(necessarily(not(X))) ),
file('theBenchmark.p',op_possibly) ).
fof(op_strict_implies,axiom,
( op_strict_implies
=> ! [X,Y] : strict_implies(X,Y) = necessarily(implies(X,Y)) ),
file('theBenchmark.p',op_strict_implies) ).
fof(s1_0_m6s3m9b_axiom_m9,conjecture,
axiom_m9,
file('theBenchmark.p',s1_0_m6s3m9b_axiom_m9) ).
fof(s1_0_m6s3m9b_axiom_m9_neg,negated_conjecture,
~ axiom_m9,
inference(assume_negation,[status(cth)],[s1_0_m6s3m9b_axiom_m9]) ).
cnf(c_60,plain,
( is_a_theorem(B)
| ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| ~ modus_ponens ),
inference(clausify,[status(thm)],[modus_ponens]) ).
cnf(c_64,plain,
( B = A
| ~ is_a_theorem(equiv(A,B))
| ~ substitution_of_equivalents ),
inference(clausify,[status(thm)],[substitution_of_equivalents]) ).
cnf(c_69,plain,
( is_a_theorem(implies(A,implies(B,A)))
| ~ implies_1 ),
inference(clausify,[status(thm)],[implies_1]) ).
cnf(c_71,plain,
( is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B)))
| ~ implies_2 ),
inference(clausify,[status(thm)],[implies_2]) ).
cnf(c_77,plain,
( is_a_theorem(implies(and(A,B),B))
| ~ and_2 ),
inference(clausify,[status(thm)],[and_2]) ).
cnf(c_79,plain,
( is_a_theorem(implies(A,implies(B,and(A,B))))
| ~ and_3 ),
inference(clausify,[status(thm)],[and_3]) ).
cnf(c_83,plain,
( is_a_theorem(implies(A,or(B,A)))
| ~ or_2 ),
inference(clausify,[status(thm)],[or_2]) ).
cnf(c_85,plain,
( is_a_theorem(implies(implies(A,B),implies(implies(C,B),implies(or(A,C),B))))
| ~ or_3 ),
inference(clausify,[status(thm)],[or_3]) ).
cnf(c_91,plain,
( is_a_theorem(implies(implies(A,B),implies(implies(B,A),equiv(A,B))))
| ~ equivalence_3 ),
inference(clausify,[status(thm)],[equivalence_3]) ).
cnf(c_115,plain,
( or(A,B) = not(and(not(A),not(B)))
| ~ op_or ),
inference(clausify,[status(thm)],[op_or]) ).
cnf(c_116,plain,
( not(and(not(A),not(B))) = or(A,B)
| ~ op_or ),
inference(copy,[status(thm)],[c_115]) ).
cnf(c_119,plain,
( not(and(A,not(B))) = implies(A,B)
| ~ op_implies_and ),
inference(clausify,[status(thm)],[op_implies_and]) ).
fof(hilbert_op_or,axiom,
op_or,
file('theBenchmark.p',hilbert_op_or) ).
cnf(c_122,plain,
op_or,
inference(clausify,[status(thm)],[hilbert_op_or]) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('theBenchmark.p',hilbert_op_implies_and) ).
cnf(c_123,plain,
op_implies_and,
inference(clausify,[status(thm)],[hilbert_op_implies_and]) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('theBenchmark.p',hilbert_modus_ponens) ).
cnf(c_125,plain,
modus_ponens,
inference(clausify,[status(thm)],[hilbert_modus_ponens]) ).
fof(hilbert_implies_1,axiom,
implies_1,
file('theBenchmark.p',hilbert_implies_1) ).
cnf(c_127,plain,
implies_1,
inference(clausify,[status(thm)],[hilbert_implies_1]) ).
fof(hilbert_implies_2,axiom,
implies_2,
file('theBenchmark.p',hilbert_implies_2) ).
cnf(c_128,plain,
implies_2,
inference(clausify,[status(thm)],[hilbert_implies_2]) ).
fof(hilbert_and_2,axiom,
and_2,
file('theBenchmark.p',hilbert_and_2) ).
cnf(c_131,plain,
and_2,
inference(clausify,[status(thm)],[hilbert_and_2]) ).
fof(hilbert_and_3,axiom,
and_3,
file('theBenchmark.p',hilbert_and_3) ).
cnf(c_132,plain,
and_3,
inference(clausify,[status(thm)],[hilbert_and_3]) ).
fof(hilbert_or_2,axiom,
or_2,
file('theBenchmark.p',hilbert_or_2) ).
cnf(c_134,plain,
or_2,
inference(clausify,[status(thm)],[hilbert_or_2]) ).
fof(hilbert_or_3,axiom,
or_3,
file('theBenchmark.p',hilbert_or_3) ).
cnf(c_135,plain,
or_3,
inference(clausify,[status(thm)],[hilbert_or_3]) ).
fof(hilbert_equivalence_3,axiom,
equivalence_3,
file('theBenchmark.p',hilbert_equivalence_3) ).
cnf(c_138,plain,
equivalence_3,
inference(clausify,[status(thm)],[hilbert_equivalence_3]) ).
fof(use_substitution_of_equivalents,axiom,
substitution_of_equivalents,
file('theBenchmark.p',use_substitution_of_equivalents) ).
cnf(c_139,plain,
substitution_of_equivalents,
inference(clausify,[status(thm)],[use_substitution_of_equivalents]) ).
cnf(c_140,plain,
( is_a_theorem(necessarily(A))
| ~ is_a_theorem(A)
| ~ necessitation ),
inference(clausify,[status(thm)],[necessitation]) ).
cnf(c_156,plain,
( is_a_theorem(implies(necessarily(A),A))
| ~ axiom_M ),
inference(clausify,[status(thm)],[axiom_M]) ).
cnf(c_158,plain,
( is_a_theorem(implies(necessarily(A),necessarily(necessarily(A))))
| ~ axiom_4 ),
inference(clausify,[status(thm)],[axiom_4]) ).
fof(nnf_53,plain,
( ( ? [X] : ~ is_a_theorem(strict_implies(possibly(possibly(X)),possibly(X)))
| axiom_m9 )
& ( ! [X0] : is_a_theorem(strict_implies(possibly(possibly(X0)),possibly(X0)))
| ~ axiom_m9 ) ),
inference(fof_nnf,[status(thm)],[axiom_m9]) ).
fof(sk_axiom_m9_sk,plain,
( ( ~ is_a_theorem(strict_implies(possibly(possibly(sK0)),possibly(sK0)))
| axiom_m9 )
& ( ! [X0] : is_a_theorem(strict_implies(possibly(possibly(X0)),possibly(X0)))
| ~ axiom_m9 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X,sK0)],[nnf_53]) ).
fof(sk_axiom_m9,plain,
( ( ~ is_a_theorem(strict_implies(possibly(possibly(sK0)),possibly(sK0)))
| axiom_m9 )
& ! [VAR_0] :
( is_a_theorem(strict_implies(possibly(possibly(VAR_0)),possibly(VAR_0)))
| ~ axiom_m9 ) ),
inference(cnf_transformation,[status(thm)],[sk_axiom_m9_sk]) ).
cnf(c_189,plain,
( ~ is_a_theorem(strict_implies(possibly(possibly(sK0)),possibly(sK0)))
| axiom_m9 ),
inference(split_conjunct,[status(thm)],[sk_axiom_m9]) ).
cnf(c_192,plain,
( possibly(A) = not(necessarily(not(A)))
| ~ op_possibly ),
inference(clausify,[status(thm)],[op_possibly]) ).
cnf(c_193,plain,
( not(necessarily(not(A))) = possibly(A)
| ~ op_possibly ),
inference(copy,[status(thm)],[c_192]) ).
cnf(c_196,plain,
( strict_implies(A,B) = necessarily(implies(A,B))
| ~ op_strict_implies ),
inference(clausify,[status(thm)],[op_strict_implies]) ).
cnf(c_197,plain,
( necessarily(implies(A,B)) = strict_implies(A,B)
| ~ op_strict_implies ),
inference(copy,[status(thm)],[c_196]) ).
fof(km4b_op_possibly,axiom,
op_possibly,
file('theBenchmark.p',km4b_op_possibly) ).
cnf(c_200,plain,
op_possibly,
inference(clausify,[status(thm)],[km4b_op_possibly]) ).
fof(km4b_necessitation,axiom,
necessitation,
file('theBenchmark.p',km4b_necessitation) ).
cnf(c_201,plain,
necessitation,
inference(clausify,[status(thm)],[km4b_necessitation]) ).
fof(km4b_axiom_M,axiom,
axiom_M,
file('theBenchmark.p',km4b_axiom_M) ).
cnf(c_203,plain,
axiom_M,
inference(clausify,[status(thm)],[km4b_axiom_M]) ).
fof(km4b_axiom_4,axiom,
axiom_4,
file('theBenchmark.p',km4b_axiom_4) ).
cnf(c_204,plain,
axiom_4,
inference(clausify,[status(thm)],[km4b_axiom_4]) ).
fof(s1_0_op_strict_implies,axiom,
op_strict_implies,
file('theBenchmark.p',s1_0_op_strict_implies) ).
cnf(c_207,plain,
op_strict_implies,
inference(clausify,[status(thm)],[s1_0_op_strict_implies]) ).
cnf(c_209,negated_conjecture,
~ axiom_m9,
inference(clausify,[status(thm)],[s1_0_m6s3m9b_axiom_m9_neg]) ).
cnf(c_210,plain,
not(and(not(A),not(B))) = or(A,B),
inference(resolve,[status(thm)],[c_122,c_116]) ).
cnf(c_211,plain,
not(and(A,not(B))) = implies(A,B),
inference(resolve,[status(thm)],[c_123,c_119]) ).
cnf(c_213,plain,
( is_a_theorem(B)
| ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_125,c_60]) ).
cnf(c_215,plain,
is_a_theorem(implies(A,implies(B,A))),
inference(resolve,[status(thm)],[c_127,c_69]) ).
cnf(c_216,plain,
is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))),
inference(resolve,[status(thm)],[c_128,c_71]) ).
cnf(c_219,plain,
is_a_theorem(implies(and(A,B),B)),
inference(resolve,[status(thm)],[c_131,c_77]) ).
cnf(c_220,plain,
is_a_theorem(implies(A,implies(B,and(A,B)))),
inference(resolve,[status(thm)],[c_132,c_79]) ).
cnf(c_222,plain,
is_a_theorem(implies(A,or(B,A))),
inference(resolve,[status(thm)],[c_134,c_83]) ).
cnf(c_223,plain,
is_a_theorem(implies(implies(A,B),implies(implies(C,B),implies(or(A,C),B)))),
inference(resolve,[status(thm)],[c_135,c_85]) ).
cnf(c_226,plain,
is_a_theorem(implies(implies(A,B),implies(implies(B,A),equiv(A,B)))),
inference(resolve,[status(thm)],[c_138,c_91]) ).
cnf(c_227,plain,
( B = A
| ~ is_a_theorem(equiv(A,B)) ),
inference(resolve,[status(thm)],[c_139,c_64]) ).
cnf(c_229,plain,
not(necessarily(not(A))) = possibly(A),
inference(resolve,[status(thm)],[c_200,c_193]) ).
cnf(c_230,plain,
( is_a_theorem(necessarily(A))
| ~ is_a_theorem(A) ),
inference(resolve,[status(thm)],[c_201,c_140]) ).
cnf(c_232,plain,
is_a_theorem(implies(necessarily(A),A)),
inference(resolve,[status(thm)],[c_203,c_156]) ).
cnf(c_233,plain,
is_a_theorem(implies(necessarily(A),necessarily(necessarily(A)))),
inference(resolve,[status(thm)],[c_204,c_158]) ).
cnf(c_235,plain,
necessarily(implies(A,B)) = strict_implies(A,B),
inference(resolve,[status(thm)],[c_207,c_197]) ).
cnf(c_237,negated_conjecture,
~ is_a_theorem(strict_implies(possibly(possibly(sK0)),possibly(sK0))),
inference(resolve,[status(thm)],[c_209,c_189]) ).
cnf(c_238,plain,
implies(not(A),B) = or(A,B),
inference(paramod,[status(thm)],[c_211,c_210]) ).
cnf(c_261,plain,
( is_a_theorem(implies(A,B))
| ~ is_a_theorem(implies(A,implies(A,B))) ),
inference(resolve,[status(thm)],[c_216,c_213]) ).
cnf(c_291,plain,
( is_a_theorem(implies(implies(B,A),equiv(A,B)))
| ~ is_a_theorem(implies(A,B)) ),
inference(resolve,[status(thm)],[c_226,c_213]) ).
cnf(c_309,plain,
not(and(A,possibly(B))) = implies(A,necessarily(not(B))),
inference(paramod,[status(thm)],[c_229,c_211]) ).
cnf(c_369,plain,
necessarily(or(A,B)) = strict_implies(not(A),B),
inference(paramod,[status(thm)],[c_238,c_235]) ).
cnf(c_642,plain,
is_a_theorem(implies(implies(A,B),implies(or(A,A),B))),
inference(resolve,[status(thm)],[c_261,c_223]) ).
cnf(c_643,plain,
is_a_theorem(implies(A,and(A,A))),
inference(resolve,[status(thm)],[c_261,c_220]) ).
cnf(c_645,plain,
is_a_theorem(implies(A,A)),
inference(resolve,[status(thm)],[c_261,c_215]) ).
cnf(c_21347,plain,
is_a_theorem(necessarily(implies(A,A))),
inference(resolve,[status(thm)],[c_645,c_230]) ).
cnf(c_696,plain,
is_a_theorem(strict_implies(A,A)),
inference(paramod,[status(thm)],[c_235,c_21347]) ).
cnf(c_2650,plain,
is_a_theorem(implies(implies(necessarily(necessarily(A)),necessarily(A)),equiv(necessarily(A),necessarily(necessarily(A))))),
inference(resolve,[status(thm)],[c_291,c_233]) ).
cnf(c_2656,plain,
is_a_theorem(implies(implies(or(A,B),B),equiv(B,or(A,B)))),
inference(resolve,[status(thm)],[c_291,c_222]) ).
cnf(c_2659,plain,
is_a_theorem(implies(implies(A,and(B,A)),equiv(and(B,A),A))),
inference(resolve,[status(thm)],[c_291,c_219]) ).
cnf(c_21348,plain,
not(necessarily(implies(A,necessarily(not(B))))) = possibly(and(A,possibly(B))),
inference(paramod,[status(thm)],[c_309,c_229]) ).
cnf(c_2957,plain,
not(strict_implies(A,necessarily(not(B)))) = possibly(and(A,possibly(B))),
inference(paramod,[status(thm)],[c_235,c_21348]) ).
cnf(c_15034,plain,
( is_a_theorem(implies(or(A,A),B))
| ~ is_a_theorem(implies(A,B)) ),
inference(resolve,[status(thm)],[c_642,c_213]) ).
cnf(c_15103,plain,
is_a_theorem(implies(or(A,A),A)),
inference(resolve,[status(thm)],[c_15034,c_645]) ).
cnf(c_21349,plain,
( is_a_theorem(equiv(necessarily(A),necessarily(necessarily(A))))
| ~ is_a_theorem(implies(necessarily(necessarily(A)),necessarily(A))) ),
inference(resolve,[status(thm)],[c_2650,c_213]) ).
cnf(c_19796,plain,
is_a_theorem(equiv(necessarily(A),necessarily(necessarily(A)))),
inference(resolve,[status(thm)],[c_232,c_21349]) ).
cnf(c_19896,plain,
necessarily(necessarily(A)) = necessarily(A),
inference(resolve,[status(thm)],[c_19796,c_227]) ).
cnf(c_20140,plain,
( is_a_theorem(equiv(B,or(A,B)))
| ~ is_a_theorem(implies(or(A,B),B)) ),
inference(resolve,[status(thm)],[c_2656,c_213]) ).
cnf(c_20197,plain,
is_a_theorem(equiv(A,or(A,A))),
inference(resolve,[status(thm)],[c_20140,c_15103]) ).
cnf(c_20243,plain,
or(A,A) = A,
inference(resolve,[status(thm)],[c_20197,c_227]) ).
cnf(c_21350,plain,
necessarily(A) = strict_implies(not(A),A),
inference(paramod,[status(thm)],[c_20243,c_369]) ).
cnf(c_20258,plain,
strict_implies(not(A),A) = necessarily(A),
inference(copy,[status(thm)],[c_21350]) ).
cnf(c_20351,plain,
( is_a_theorem(equiv(and(B,A),A))
| ~ is_a_theorem(implies(A,and(B,A))) ),
inference(resolve,[status(thm)],[c_2659,c_213]) ).
cnf(c_21351,plain,
not(necessarily(necessarily(not(A)))) = possibly(and(not(necessarily(not(A))),possibly(A))),
inference(paramod,[status(thm)],[c_20258,c_2957]) ).
cnf(c_21352,plain,
not(necessarily(not(A))) = possibly(and(not(necessarily(not(A))),possibly(A))),
inference(paramod,[status(thm)],[c_19896,c_21351]) ).
cnf(c_21353,plain,
possibly(A) = possibly(and(not(necessarily(not(A))),possibly(A))),
inference(paramod,[status(thm)],[c_229,c_21352]) ).
cnf(c_21354,plain,
possibly(A) = possibly(and(possibly(A),possibly(A))),
inference(paramod,[status(thm)],[c_229,c_21353]) ).
cnf(c_21023,plain,
possibly(and(possibly(A),possibly(A))) = possibly(A),
inference(copy,[status(thm)],[c_21354]) ).
cnf(c_21312,plain,
is_a_theorem(equiv(and(A,A),A)),
inference(resolve,[status(thm)],[c_20351,c_643]) ).
cnf(c_21355,plain,
A = and(A,A),
inference(resolve,[status(thm)],[c_21312,c_227]) ).
cnf(c_21331,plain,
and(A,A) = A,
inference(copy,[status(thm)],[c_21355]) ).
cnf(c_21334,plain,
possibly(possibly(A)) = possibly(A),
inference(paramod,[status(thm)],[c_21331,c_21023]) ).
cnf(c_21356,negated_conjecture,
~ is_a_theorem(strict_implies(possibly(sK0),possibly(sK0))),
inference(paramod,[status(thm)],[c_21334,c_237]) ).
cnf(c_21346,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_696,c_21356]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL548+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/5.44 % Computer : n001.cluster.edu
% 0.16/5.44 % Model : x86_64 x86_64
% 0.16/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.44 % Memory : 8046.5625MB
% 0.16/5.44 % OS : Linux 6.8.0-71-generic
% 0.16/5.44 % CPULimit : 300
% 0.16/5.44 % WCLimit : 300
% 0.16/5.44 % DateTime : Fri Sep 25 22:49:48 UTC 2026
% 0.16/5.45 % CPUTime :
% 0.16/5.45 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/5.45 % Process 249964 was started by sandbox on n001,
% 0.16/5.45 % Fri Sep 25 22:49:48 2026
% 0.16/5.45 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.16/5.47
% 0.16/5.47 % From the command line: assign(max_seconds, 300).
% 110.87/20.40
% 110.87/20.40 % given #500 (T,wt=23): 13391 is_a_theorem(and(strict_implies(A,A),strict_equiv(B,B))). [resolve(11369,a,696,a)].
% 110.87/20.40
% 110.87/20.40 % SZS status Theorem for theBenchmark
% 110.87/20.40
% 110.87/20.40 % Proof 1 at 5.62 (+ 1.14) seconds.
% 110.87/20.40 % Length of proof is 99.
% 110.87/20.40 % Level of proof is 12.
% 110.87/20.40 % Maximum clause weight is 40.000.
% 110.87/20.40 % Given clauses 825.
% 110.87/20.40
% 110.87/20.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------