%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL523+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.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:54:47 AM UTC 2026
% Result : Theorem 87.52s 13.00s
% Output : CNFRefutation 87.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 35
% Syntax : Number of formulae : 139 ( 73 unt; 0 def)
% Number of atoms : 228 ( 31 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 154 ( 65 ~; 65 |; 2 &)
% ( 15 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 22 ( 20 usr; 20 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 136 ( 9 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(modus_ponens,axiom,
( 'modus$uponens'
<=> ! [X0,X1] :
( ( 'is$ua$utheorem'(implies(X0,X1))
& 'is$ua$utheorem'(X0) )
=> 'is$ua$utheorem'(X1) ) ) ).
fof(substitution_of_equivalents,axiom,
( 'substitution$uof$uequivalents'
<=> ! [X0,X1] :
( 'is$ua$utheorem'(equiv(X0,X1))
=> X0 = X1 ) ) ).
fof(modus_tollens,axiom,
( 'modus$utollens'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(implies(not(X1),not(X0)),implies(X0,X1))) ) ).
fof(implies_1,axiom,
( 'implies$u1'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(X0,implies(X1,X0))) ) ).
fof(implies_2,axiom,
( 'implies$u2'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ) ).
fof(and_1,axiom,
( 'and$u1'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(and(X0,X1),X0)) ) ).
fof(and_3,axiom,
( 'and$u3'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(X0,implies(X1,and(X0,X1)))) ) ).
fof(or_1,axiom,
( 'or$u1'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(X0,or(X0,X1))) ) ).
fof(or_2,axiom,
( 'or$u2'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(X1,or(X0,X1))) ) ).
fof(kn1,axiom,
( kn1
<=> ! [X0] : 'is$ua$utheorem'(implies(X0,and(X0,X0))) ) ).
fof(r1,axiom,
( r1
<=> ! [X0] : 'is$ua$utheorem'(implies(or(X0,X0),X0)) ) ).
fof(op_or,axiom,
( 'op$uor'
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ) ).
fof(op_implies_and,axiom,
( 'op$uimplies$uand'
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ) ).
fof(op_equiv,axiom,
( 'op$uequiv'
=> ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ) ).
fof(hilbert_op_or,axiom,
'op$uor' ).
fof(hilbert_op_implies_and,axiom,
'op$uimplies$uand' ).
fof(hilbert_op_equiv,axiom,
'op$uequiv' ).
fof(hilbert_modus_ponens,axiom,
'modus$uponens' ).
fof(hilbert_modus_tollens,axiom,
'modus$utollens' ).
fof(hilbert_implies_1,axiom,
'implies$u1' ).
fof(hilbert_implies_2,axiom,
'implies$u2' ).
fof(hilbert_and_1,axiom,
'and$u1' ).
fof(hilbert_and_3,axiom,
'and$u3' ).
fof(hilbert_or_1,axiom,
'or$u1' ).
fof(hilbert_or_2,axiom,
'or$u2' ).
fof(use_substitution_of_equivalents,axiom,
'substitution$uof$uequivalents' ).
fof(adjunction,axiom,
( adjunction
<=> ! [X0,X1] :
( ( 'is$ua$utheorem'(X1)
& 'is$ua$utheorem'(X0) )
=> 'is$ua$utheorem'(and(X0,X1)) ) ) ).
fof(axiom_M,axiom,
( 'axiom$uM'
<=> ! [X0] : 'is$ua$utheorem'(implies(necessarily(X0),X0)) ) ).
fof(axiom_4,axiom,
( 'axiom$u4'
<=> ! [X0] : 'is$ua$utheorem'(implies(necessarily(X0),necessarily(necessarily(X0)))) ) ).
fof(axiom_5,axiom,
( 'axiom$u5'
<=> ! [X0] : 'is$ua$utheorem'(implies(possibly(X0),necessarily(possibly(X0)))) ) ).
fof(op_possibly,axiom,
( 'op$upossibly'
=> ! [X0] : possibly(X0) = not(necessarily(not(X0))) ) ).
fof(km5_op_possibly,axiom,
'op$upossibly' ).
fof(km5_axiom_M,axiom,
'axiom$uM' ).
fof(km5_axiom_5,axiom,
'axiom$u5' ).
fof(km4b_axiom_4,conjecture,
'axiom$u4' ).
fof(negated_conjecture,negated_conjecture,
~ 'axiom$u4',
inference(negate_conjecture,[status(cth)],[km4b_axiom_4]) ).
cnf(c0,plain,
( 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(implies(X0,X1))
| ~ 'is$ua$utheorem'(X0)
| ~ 'modus$uponens' ),
inference(clausification,[status(esa)],[modus_ponens]) ).
cnf(c4,plain,
( X0 = X1
| ~ 'is$ua$utheorem'(equiv(X0,X1))
| ~ 'substitution$uof$uequivalents' ),
inference(clausification,[status(esa)],[substitution_of_equivalents]) ).
cnf(c7,plain,
( 'is$ua$utheorem'(implies(implies(not(X0),not(X1)),implies(X1,X0)))
| ~ 'modus$utollens' ),
inference(clausification,[status(esa)],[modus_tollens]) ).
cnf(c9,plain,
( 'is$ua$utheorem'(implies(X0,implies(X1,X0)))
| ~ 'implies$u1' ),
inference(clausification,[status(esa)],[implies_1]) ).
cnf(c11,plain,
( 'is$ua$utheorem'(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ 'implies$u2' ),
inference(clausification,[status(esa)],[implies_2]) ).
cnf(c15,plain,
( 'is$ua$utheorem'(implies(and(X0,X1),X0))
| ~ 'and$u1' ),
inference(clausification,[status(esa)],[and_1]) ).
cnf(c19,plain,
( 'is$ua$utheorem'(implies(X0,implies(X1,and(X0,X1))))
| ~ 'and$u3' ),
inference(clausification,[status(esa)],[and_3]) ).
cnf(c21,plain,
( 'is$ua$utheorem'(implies(X0,or(X0,X1)))
| ~ 'or$u1' ),
inference(clausification,[status(esa)],[or_1]) ).
cnf(c23,plain,
( 'is$ua$utheorem'(implies(X0,or(X1,X0)))
| ~ 'or$u2' ),
inference(clausification,[status(esa)],[or_2]) ).
cnf(c33,plain,
( 'is$ua$utheorem'(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(clausification,[status(esa)],[kn1]) ).
cnf(c34,plain,
( ~ 'is$ua$utheorem'(implies(sK65,and(sK65,sK65)))
| kn1 ),
inference(clausification,[status(esa)],[kn1]) ).
cnf(c45,plain,
( 'is$ua$utheorem'(implies(or(X0,X0),X0))
| ~ r1 ),
inference(clausification,[status(esa)],[r1]) ).
cnf(c46,plain,
( ~ 'is$ua$utheorem'(implies(or(sK89,sK89),sK89))
| r1 ),
inference(clausification,[status(esa)],[r1]) ).
cnf(c55,plain,
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ 'op$uor' ),
inference(clausification,[status(esa)],[op_or]) ).
cnf(c57,plain,
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ 'op$uimplies$uand' ),
inference(clausification,[status(esa)],[op_implies_and]) ).
cnf(c59,plain,
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ 'op$uequiv' ),
inference(clausification,[status(esa)],[op_equiv]) ).
cnf(c60,plain,
'op$uor',
inference(clausification,[status(esa)],[hilbert_op_or]) ).
cnf(c61,plain,
'op$uimplies$uand',
inference(clausification,[status(esa)],[hilbert_op_implies_and]) ).
cnf(c62,plain,
'op$uequiv',
inference(clausification,[status(esa)],[hilbert_op_equiv]) ).
cnf(c63,plain,
'modus$uponens',
inference(clausification,[status(esa)],[hilbert_modus_ponens]) ).
cnf(c64,plain,
'modus$utollens',
inference(clausification,[status(esa)],[hilbert_modus_tollens]) ).
cnf(c65,plain,
'implies$u1',
inference(clausification,[status(esa)],[hilbert_implies_1]) ).
cnf(c66,plain,
'implies$u2',
inference(clausification,[status(esa)],[hilbert_implies_2]) ).
cnf(c68,plain,
'and$u1',
inference(clausification,[status(esa)],[hilbert_and_1]) ).
cnf(c70,plain,
'and$u3',
inference(clausification,[status(esa)],[hilbert_and_3]) ).
cnf(c71,plain,
'or$u1',
inference(clausification,[status(esa)],[hilbert_or_1]) ).
cnf(c72,plain,
'or$u2',
inference(clausification,[status(esa)],[hilbert_or_2]) ).
cnf(c77,plain,
'substitution$uof$uequivalents',
inference(clausification,[status(esa)],[use_substitution_of_equivalents]) ).
cnf(c85,plain,
( 'is$ua$utheorem'(and(X0,X1))
| ~ 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(X0)
| ~ adjunction ),
inference(clausification,[status(esa)],[adjunction]) ).
cnf(c86,plain,
( 'is$ua$utheorem'(sK128)
| adjunction ),
inference(clausification,[status(esa)],[adjunction]) ).
cnf(c87,plain,
( 'is$ua$utheorem'(sK129)
| adjunction ),
inference(clausification,[status(esa)],[adjunction]) ).
cnf(c88,plain,
( ~ 'is$ua$utheorem'(and(sK128,sK129))
| adjunction ),
inference(clausification,[status(esa)],[adjunction]) ).
cnf(c94,plain,
( 'is$ua$utheorem'(implies(necessarily(X0),X0))
| ~ 'axiom$uM' ),
inference(clausification,[status(esa)],[axiom_M]) ).
cnf(c97,plain,
( ~ 'is$ua$utheorem'(implies(necessarily(sK141),necessarily(necessarily(sK141))))
| 'axiom$u4' ),
inference(clausification,[status(esa)],[axiom_4]) ).
cnf(c100,plain,
( 'is$ua$utheorem'(implies(possibly(X0),necessarily(possibly(X0))))
| ~ 'axiom$u5' ),
inference(clausification,[status(esa)],[axiom_5]) ).
cnf(c130,plain,
( possibly(X0) = not(necessarily(not(X0)))
| ~ 'op$upossibly' ),
inference(clausification,[status(esa)],[op_possibly]) ).
cnf(c134,plain,
'op$upossibly',
inference(clausification,[status(esa)],[km5_op_possibly]) ).
cnf(c137,plain,
'axiom$uM',
inference(clausification,[status(esa)],[km5_axiom_M]) ).
cnf(c138,plain,
'axiom$u5',
inference(clausification,[status(esa)],[km5_axiom_5]) ).
cnf(c139,plain,
~ 'axiom$u4',
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
implies(X0,X1) = not(and(X0,not(X1))),
inference(resolution,[status(thm)],[c61,c57]) ).
cnf(d1,plain,
or(X0,X1) = not(and(not(X0),not(X1))),
inference(resolution,[status(thm)],[c60,c55]) ).
cnf(d2,plain,
or(X0,X1) = implies(not(X0),X1),
inference(demodulation,[status(thm)],[d1,d0]) ).
cnf(d3,plain,
( ~ 'is$ua$utheorem'(equiv(X0,X1))
| X0 = X1 ),
inference(resolution,[status(thm)],[c77,c4]) ).
cnf(d4,plain,
equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(resolution,[status(thm)],[c62,c59]) ).
cnf(d5,plain,
( ~ adjunction
| ~ 'is$ua$utheorem'(implies(X0,X1))
| ~ 'is$ua$utheorem'(implies(X1,X0))
| 'is$ua$utheorem'(equiv(X0,X1)) ),
inference(superposition,[status(thm)],[d4,c85]) ).
cnf(d6,plain,
( ~ kn1
| ~ adjunction
| 'is$ua$utheorem'(equiv(X0,and(X0,X0)))
| ~ 'is$ua$utheorem'(implies(and(X0,X0),X0)) ),
inference(resolution,[status(thm)],[d5,c33]) ).
cnf(d7,plain,
'is$ua$utheorem'(implies(and(X0,X1),X0)),
inference(resolution,[status(thm)],[c68,c15]) ).
cnf(d8,plain,
( ~ adjunction
| ~ kn1
| 'is$ua$utheorem'(equiv(X0,and(X0,X0))) ),
inference(resolution,[status(thm)],[d7,d6]) ).
cnf(d9,plain,
'is$ua$utheorem'(implies(X0,implies(X1,and(X0,X1)))),
inference(resolution,[status(thm)],[c70,c19]) ).
cnf(d10,plain,
'is$ua$utheorem'(implies(implies(X0,implies(X0,X1)),implies(X0,X1))),
inference(resolution,[status(thm)],[c66,c11]) ).
cnf(d11,plain,
( ~ 'is$ua$utheorem'(implies(X1,X0))
| ~ 'is$ua$utheorem'(X1)
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[c63,c0]) ).
cnf(d12,plain,
( 'is$ua$utheorem'(implies(X0,X1))
| ~ 'is$ua$utheorem'(implies(X0,implies(X0,X1))) ),
inference(resolution,[status(thm)],[d11,d10]) ).
cnf(d13,plain,
'is$ua$utheorem'(implies(X0,and(X0,X0))),
inference(resolution,[status(thm)],[d12,d9]) ).
cnf(d14,plain,
kn1,
inference(resolution,[status(thm)],[d13,c34]) ).
cnf(d15,plain,
( ~ adjunction
| 'is$ua$utheorem'(equiv(X0,and(X0,X0))) ),
inference(resolution,[status(thm)],[d14,d8]) ).
cnf(d16,plain,
( 'is$ua$utheorem'(implies(X1,and(X0,X1)))
| ~ 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[d11,d9]) ).
cnf(d17,plain,
( 'is$ua$utheorem'(and(X0,X1))
| ~ 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[d16,d11]) ).
cnf(d18,plain,
( adjunction
| ~ 'is$ua$utheorem'(sK128)
| ~ 'is$ua$utheorem'(sK129) ),
inference(resolution,[status(thm)],[d17,c88]) ).
cnf(d19,plain,
( adjunction
| adjunction
| ~ 'is$ua$utheorem'(sK128) ),
inference(resolution,[status(thm)],[d18,c87]) ).
cnf(d20,plain,
( adjunction
| adjunction ),
inference(resolution,[status(thm)],[d19,c86]) ).
cnf(d21,plain,
'is$ua$utheorem'(equiv(X0,and(X0,X0))),
inference(resolution,[status(thm)],[d20,d15]) ).
cnf(d22,plain,
X0 = and(X0,X0),
inference(resolution,[status(thm)],[d21,d3]) ).
cnf(d23,plain,
implies(not(X0),X0) = not(not(X0)),
inference(superposition,[status(thm)],[d22,d0]) ).
cnf(d24,plain,
or(X0,X0) = not(not(X0)),
inference(demodulation,[status(thm)],[d23,d2]) ).
cnf(d25,plain,
( ~ r1
| ~ adjunction
| 'is$ua$utheorem'(equiv(or(X0,X0),X0))
| ~ 'is$ua$utheorem'(implies(X0,or(X0,X0))) ),
inference(resolution,[status(thm)],[d5,c45]) ).
cnf(d26,plain,
'is$ua$utheorem'(implies(X0,or(X0,X1))),
inference(resolution,[status(thm)],[c71,c21]) ).
cnf(d27,plain,
( ~ adjunction
| ~ r1
| 'is$ua$utheorem'(equiv(or(X0,X0),X0)) ),
inference(resolution,[status(thm)],[d26,d25]) ).
cnf(d28,plain,
( ~ r1
| 'is$ua$utheorem'(equiv(or(X0,X0),X0)) ),
inference(resolution,[status(thm)],[d20,d27]) ).
cnf(d29,plain,
( or(X0,X0) = X0
| ~ r1 ),
inference(resolution,[status(thm)],[d28,d3]) ).
cnf(d30,plain,
( ~ r1
| not(not(X0)) = X0 ),
inference(demodulation,[status(thm)],[d29,d24]) ).
cnf(d31,plain,
( r1
| ~ 'is$ua$utheorem'(implies(not(not(sK89)),sK89)) ),
inference(demodulation,[status(thm)],[c46,d24]) ).
cnf(d32,plain,
( r1
| ~ 'is$ua$utheorem'(or(not(sK89),sK89)) ),
inference(demodulation,[status(thm)],[d31,d2]) ).
cnf(d33,plain,
'is$ua$utheorem'(implies(implies(not(X0),not(X1)),implies(X1,X0))),
inference(resolution,[status(thm)],[c64,c7]) ).
cnf(d34,plain,
( 'is$ua$utheorem'(implies(X1,X0))
| ~ 'is$ua$utheorem'(implies(not(X0),not(X1))) ),
inference(resolution,[status(thm)],[d11,d33]) ).
cnf(d35,plain,
( ~ 'is$ua$utheorem'(or(X0,not(X1)))
| 'is$ua$utheorem'(implies(X1,X0)) ),
inference(demodulation,[status(thm)],[d34,d2]) ).
cnf(d36,plain,
'is$ua$utheorem'(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[c72,c23]) ).
cnf(d37,plain,
'is$ua$utheorem'(or(X0,or(X1,not(X0)))),
inference(superposition,[status(thm)],[d2,d36]) ).
cnf(d38,plain,
'is$ua$utheorem'(or(X0,not(not(not(X0))))),
inference(superposition,[status(thm)],[d24,d37]) ).
cnf(d39,plain,
'is$ua$utheorem'(implies(not(not(X0)),X0)),
inference(resolution,[status(thm)],[d38,d35]) ).
cnf(d40,plain,
'is$ua$utheorem'(or(not(X0),X0)),
inference(demodulation,[status(thm)],[d39,d2]) ).
cnf(d41,plain,
r1,
inference(resolution,[status(thm)],[d40,d32]) ).
cnf(d42,plain,
not(not(X0)) = X0,
inference(resolution,[status(thm)],[d41,d30]) ).
cnf(d43,plain,
possibly(X0) = not(necessarily(not(X0))),
inference(resolution,[status(thm)],[c134,c130]) ).
cnf(d44,plain,
not(possibly(X0)) = necessarily(not(X0)),
inference(superposition,[status(thm)],[d43,d42]) ).
cnf(d45,plain,
'is$ua$utheorem'(implies(possibly(X0),necessarily(possibly(X0)))),
inference(resolution,[status(thm)],[c138,c100]) ).
cnf(d46,plain,
( ~ adjunction
| 'is$ua$utheorem'(equiv(possibly(X0),necessarily(possibly(X0))))
| ~ 'is$ua$utheorem'(implies(necessarily(possibly(X0)),possibly(X0))) ),
inference(resolution,[status(thm)],[d5,d45]) ).
cnf(d47,plain,
'is$ua$utheorem'(implies(necessarily(X0),X0)),
inference(resolution,[status(thm)],[c137,c94]) ).
cnf(d48,plain,
( ~ adjunction
| 'is$ua$utheorem'(equiv(possibly(X0),necessarily(possibly(X0)))) ),
inference(resolution,[status(thm)],[d47,d46]) ).
cnf(d49,plain,
'is$ua$utheorem'(equiv(possibly(X0),necessarily(possibly(X0)))),
inference(resolution,[status(thm)],[d20,d48]) ).
cnf(d50,plain,
possibly(X0) = necessarily(possibly(X0)),
inference(resolution,[status(thm)],[d49,d3]) ).
cnf(d51,plain,
possibly(necessarily(not(X0))) = not(necessarily(possibly(X0))),
inference(superposition,[status(thm)],[d43,d43]) ).
cnf(d52,plain,
possibly(necessarily(not(X0))) = not(possibly(X0)),
inference(demodulation,[status(thm)],[d51,d50]) ).
cnf(d53,plain,
possibly(necessarily(not(X0))) = necessarily(not(X0)),
inference(demodulation,[status(thm)],[d52,d44]) ).
cnf(d54,plain,
possibly(necessarily(X0)) = necessarily(not(not(X0))),
inference(superposition,[status(thm)],[d42,d53]) ).
cnf(d55,plain,
possibly(necessarily(X0)) = necessarily(X0),
inference(demodulation,[status(thm)],[d54,d42]) ).
cnf(d56,plain,
possibly(necessarily(X0)) = necessarily(necessarily(X0)),
inference(superposition,[status(thm)],[d55,d50]) ).
cnf(d57,plain,
necessarily(X0) = necessarily(necessarily(X0)),
inference(demodulation,[status(thm)],[d56,d55]) ).
cnf(d58,plain,
~ 'is$ua$utheorem'(implies(necessarily(sK141),necessarily(necessarily(sK141)))),
inference(resolution,[status(thm)],[c139,c97]) ).
cnf(d59,plain,
~ 'is$ua$utheorem'(implies(necessarily(sK141),necessarily(sK141))),
inference(demodulation,[status(thm)],[d58,d57]) ).
cnf(d60,plain,
'is$ua$utheorem'(implies(X0,implies(X1,X0))),
inference(resolution,[status(thm)],[c65,c9]) ).
cnf(d61,plain,
'is$ua$utheorem'(implies(X0,X0)),
inference(resolution,[status(thm)],[d12,d60]) ).
cnf(d62,plain,
$false,
inference(resolution,[status(thm)],[d61,d59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL523+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n008.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Fri Sep 25 22:42:54 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 87.52/13.00 % SZS status Theorem for theBenchmark.p
% 87.52/13.00 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------