%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : HWV020-1 : TPTP v9.3.1. Released v2.5.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:32:56 AM UTC 2026
% Result : Unsatisfiable 27.85s 4.04s
% Output : CNFRefutation 27.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 22
% Syntax : Number of clauses : 78 ( 32 unt; 20 nHn; 69 RR)
% Number of literals : 160 ( 50 equ; 61 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 61 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quest_1,negated_conjecture,
'p$uRd'('t$u139') ).
cnf(quest_2,negated_conjecture,
'p$uEmpty'('t$u139') ).
cnf(quest_3,negated_conjecture,
~ 'p$uWr'('t$u139') ).
cnf(quest_4,negated_conjecture,
~ 'p$uReset'('t$u139') ).
cnf(quest_5,negated_conjecture,
( ~ 'p$uRd$uerror'(plus('t$u139',n1))
| ~ 'p$uEmpty'(plus('t$u139',n1)) ) ).
cnf(axiom_1,axiom,
plus(X0,n1) != n0 ).
cnf(axiom_2,axiom,
gt(plus(X0,n1),n0) ).
cnf(axiom_3,axiom,
( gt(X0,minus(X0,n1))
| ~ gt(X0,n0) ) ).
cnf(axiom_4,axiom,
( 'def$u10'(X1,X0)
| plus(X2,X1) = X0
| minus(X0,X1) != X2 ) ).
cnf(axiom_7,axiom,
( X1 != X0
| ~ 'def$u10'(X0,X1) ) ).
cnf(axiom_9,axiom,
( ~ gt(plus(X0,n1),plus(X1,n1))
| gt(X0,X1) ) ).
cnf(axiom_13,axiom,
( ~ gt(X1,X2)
| gt(X0,X2)
| ~ gt(X0,X1) ) ).
cnf(axiom_14,axiom,
( gt(X0,plus(X1,n1))
| plus(X1,n1) = X0
| ~ gt(X0,X1) ) ).
cnf(axiom_16,axiom,
( X0 = plus('y$u27'(X0),n1)
| X0 = n0 ) ).
cnf(axiom_17,axiom,
~ gt(X0,X0) ).
cnf(axiom_18,axiom,
( X0 = X1
| plus(X0,n1) != plus(X1,n1) ) ).
cnf(axiom_19,axiom,
plus(n0,X0) = X0 ).
cnf(axiom_20,axiom,
n1 = plus(n0,n1) ).
cnf(axiom_24,axiom,
( 'p$uEmpty'(X0)
| 'int$ulevel'(X0) != n0 ) ).
cnf(axiom_25,axiom,
( ~ 'p$uEmpty'(X0)
| 'int$ulevel'(X0) = n0 ) ).
cnf(axiom_76,axiom,
( 'p$uRd$uerror'(plus(X0,n1))
| gt('int$ulevel'(X0),n0)
| ~ 'p$uRd'(X0)
| 'p$uWr'(X0)
| 'p$uReset'(X0) ) ).
cnf(axiom_78,axiom,
( 'int$ulevel'(plus(X0,n1)) = 'int$ulevel'(X0)
| gt('int$ulevel'(X0),n0)
| ~ 'p$uRd'(X0)
| 'p$uWr'(X0)
| 'p$uReset'(X0) ) ).
cnf(c0,plain,
'p$uRd'('t$u139'),
inference(clausification,[status(esa)],[quest_1]) ).
cnf(c1,plain,
'p$uEmpty'('t$u139'),
inference(clausification,[status(esa)],[quest_2]) ).
cnf(c2,plain,
~ 'p$uWr'('t$u139'),
inference(clausification,[status(esa)],[quest_3]) ).
cnf(c3,plain,
~ 'p$uReset'('t$u139'),
inference(clausification,[status(esa)],[quest_4]) ).
cnf(c4,plain,
( ~ 'p$uRd$uerror'(plus('t$u139',n1))
| ~ 'p$uEmpty'(plus('t$u139',n1)) ),
inference(clausification,[status(esa)],[quest_5]) ).
cnf(c5,plain,
plus(X0,n1) != n0,
inference(clausification,[status(esa)],[axiom_1]) ).
cnf(c6,plain,
gt(plus(X0,n1),n0),
inference(clausification,[status(esa)],[axiom_2]) ).
cnf(c7,plain,
( gt(X0,minus(X0,n1))
| ~ gt(X0,n0) ),
inference(clausification,[status(esa)],[axiom_3]) ).
cnf(c8,plain,
( 'def$u10'(X1,X0)
| plus(X2,X1) = X0
| minus(X0,X1) != X2 ),
inference(clausification,[status(esa)],[axiom_4]) ).
cnf(c11,plain,
( X1 != X0
| ~ 'def$u10'(X0,X1) ),
inference(clausification,[status(esa)],[axiom_7]) ).
cnf(c13,plain,
( ~ gt(plus(X0,n1),plus(X1,n1))
| gt(X0,X1) ),
inference(clausification,[status(esa)],[axiom_9]) ).
cnf(c17,plain,
( ~ gt(X1,X2)
| gt(X0,X2)
| ~ gt(X0,X1) ),
inference(clausification,[status(esa)],[axiom_13]) ).
cnf(c18,plain,
( gt(X0,plus(X1,n1))
| plus(X1,n1) = X0
| ~ gt(X0,X1) ),
inference(clausification,[status(esa)],[axiom_14]) ).
cnf(c20,plain,
( X0 = plus('y$u27'(X0),n1)
| X0 = n0 ),
inference(clausification,[status(esa)],[axiom_16]) ).
cnf(c21,plain,
~ gt(X0,X0),
inference(clausification,[status(esa)],[axiom_17]) ).
cnf(c22,plain,
( X0 = X1
| plus(X0,n1) != plus(X1,n1) ),
inference(clausification,[status(esa)],[axiom_18]) ).
cnf(c23,plain,
plus(n0,X0) = X0,
inference(clausification,[status(esa)],[axiom_19]) ).
cnf(c24,plain,
n1 = plus(n0,n1),
inference(clausification,[status(esa)],[axiom_20]) ).
cnf(c28,plain,
( 'p$uEmpty'(X0)
| 'int$ulevel'(X0) != n0 ),
inference(clausification,[status(esa)],[axiom_24]) ).
cnf(c29,plain,
( ~ 'p$uEmpty'(X0)
| 'int$ulevel'(X0) = n0 ),
inference(clausification,[status(esa)],[axiom_25]) ).
cnf(c80,plain,
( ~ 'p$uRd'(X0)
| gt('int$ulevel'(X0),n0)
| 'p$uWr'(X0)
| 'p$uRd$uerror'(plus(X0,n1))
| 'p$uReset'(X0) ),
inference(clausification,[status(esa)],[axiom_76]) ).
cnf(c82,plain,
( 'p$uReset'(X0)
| ~ 'p$uRd'(X0)
| gt('int$ulevel'(X0),n0)
| 'int$ulevel'(plus(X0,n1)) = 'int$ulevel'(X0)
| 'p$uWr'(X0) ),
inference(clausification,[status(esa)],[axiom_78]) ).
cnf(d0,plain,
'int$ulevel'('t$u139') = n0,
inference(resolution,[status(thm)],[c29,c1]) ).
cnf(d1,plain,
( 'p$uReset'('t$u139')
| 'p$uWr'('t$u139')
| ~ 'p$uRd'('t$u139')
| 'int$ulevel'(plus('t$u139',n1)) = 'int$ulevel'('t$u139')
| gt(n0,n0) ),
inference(superposition,[status(thm)],[d0,c82]) ).
cnf(d2,plain,
( gt(n0,n0)
| 'p$uReset'('t$u139')
| 'p$uWr'('t$u139')
| ~ 'p$uRd'('t$u139')
| 'int$ulevel'(plus('t$u139',n1)) = n0 ),
inference(demodulation,[status(thm)],[d1,d0]) ).
cnf(d3,plain,
( gt(n0,n0)
| 'p$uReset'('t$u139')
| 'p$uWr'('t$u139')
| 'int$ulevel'(plus('t$u139',n1)) = n0 ),
inference(resolution,[status(thm)],[c0,d2]) ).
cnf(d4,plain,
( gt(n0,n0)
| 'p$uReset'('t$u139')
| 'int$ulevel'(plus('t$u139',n1)) = n0 ),
inference(resolution,[status(thm)],[c2,d3]) ).
cnf(d5,plain,
( gt(n0,n0)
| 'int$ulevel'(plus('t$u139',n1)) = n0 ),
inference(resolution,[status(thm)],[c3,d4]) ).
cnf(d6,plain,
'int$ulevel'(plus('t$u139',n1)) = n0,
inference(resolution,[status(thm)],[c21,d5]) ).
cnf(d7,plain,
( 'p$uEmpty'(plus('t$u139',n1))
| n0 != n0 ),
inference(superposition,[status(thm)],[d6,c28]) ).
cnf(d8,plain,
( gt(n0,X0)
| ~ gt(n1,plus(X0,n1)) ),
inference(superposition,[status(thm)],[c23,c13]) ).
cnf(d9,plain,
( gt(plus(X1,n1),X0)
| ~ gt(n0,X0) ),
inference(resolution,[status(thm)],[c17,c6]) ).
cnf(d10,plain,
~ gt(n0,plus(X0,n1)),
inference(resolution,[status(thm)],[d9,c21]) ).
cnf(d11,plain,
( ~ gt(n0,X0)
| plus(X0,n1) = n0 ),
inference(resolution,[status(thm)],[d10,c18]) ).
cnf(d12,plain,
~ gt(n0,X0),
inference(resolution,[status(thm)],[c5,d11]) ).
cnf(d13,plain,
~ gt(n1,plus(X0,n1)),
inference(resolution,[status(thm)],[d12,d8]) ).
cnf(d14,plain,
( X0 = n0
| ~ gt(n1,X0) ),
inference(superposition,[status(thm)],[c20,d13]) ).
cnf(d15,plain,
( ~ gt(n1,n0)
| minus(n1,n1) = n0 ),
inference(resolution,[status(thm)],[d14,c7]) ).
cnf(d16,plain,
gt(n1,n0),
inference(superposition,[status(thm)],[c23,c6]) ).
cnf(d17,plain,
minus(n1,n1) = n0,
inference(resolution,[status(thm)],[d16,d15]) ).
cnf(d18,plain,
( n0 = X0
| n1 != plus(X0,n1) ),
inference(superposition,[status(thm)],[c23,c22]) ).
cnf(d19,plain,
~ 'def$u10'(X0,X0),
inference(equality_resolution,[status(thm)],[c11]) ).
cnf(d20,plain,
( 'def$u10'(X1,X0)
| plus(minus(X0,X1),X1) = X0 ),
inference(equality_resolution,[status(thm)],[c8]) ).
cnf(d21,plain,
plus(minus(X0,X0),X0) = X0,
inference(resolution,[status(thm)],[d20,d19]) ).
cnf(d22,plain,
( n0 = minus(n1,n1)
| n1 != n1 ),
inference(superposition,[status(thm)],[d21,d18]) ).
cnf(d23,plain,
( n0 = n0
| n1 != n1 ),
inference(demodulation,[status(thm)],[d22,d17]) ).
cnf(d24,plain,
n1 = n1,
inference(demodulation,[status(thm)],[c24,c23]) ).
cnf(d25,plain,
n0 = n0,
inference(resolution,[status(thm)],[d24,d23]) ).
cnf(d26,plain,
'p$uEmpty'(plus('t$u139',n1)),
inference(resolution,[status(thm)],[d25,d7]) ).
cnf(d27,plain,
( ~ 'p$uEmpty'(plus('t$u139',n1))
| gt('int$ulevel'('t$u139'),n0)
| 'p$uReset'('t$u139')
| 'p$uWr'('t$u139')
| ~ 'p$uRd'('t$u139') ),
inference(resolution,[status(thm)],[c80,c4]) ).
cnf(d28,plain,
( gt(n0,n0)
| 'p$uReset'('t$u139')
| 'p$uWr'('t$u139')
| ~ 'p$uEmpty'(plus('t$u139',n1))
| ~ 'p$uRd'('t$u139') ),
inference(demodulation,[status(thm)],[d27,d0]) ).
cnf(d29,plain,
( gt(n0,n0)
| 'p$uReset'('t$u139')
| 'p$uWr'('t$u139')
| ~ 'p$uEmpty'(plus('t$u139',n1)) ),
inference(resolution,[status(thm)],[c0,d28]) ).
cnf(d30,plain,
( gt(n0,n0)
| 'p$uReset'('t$u139')
| ~ 'p$uEmpty'(plus('t$u139',n1)) ),
inference(resolution,[status(thm)],[c2,d29]) ).
cnf(d31,plain,
( gt(n0,n0)
| ~ 'p$uEmpty'(plus('t$u139',n1)) ),
inference(resolution,[status(thm)],[c3,d30]) ).
cnf(d32,plain,
~ 'p$uEmpty'(plus('t$u139',n1)),
inference(resolution,[status(thm)],[c21,d31]) ).
cnf(d33,plain,
$false,
inference(resolution,[status(thm)],[d32,d26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : HWV020-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n008.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Fri Sep 25 16:02:24 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.85/4.04 % SZS status Unsatisfiable for theBenchmark.p
% 27.85/4.04 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------