%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWV379+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n005.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 09:02:13 AM UTC 2026
% Result : Theorem 39.80s 5.72s
% Output : CNFRefutation 39.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 85 ( 28 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 84 ( 34 ~; 36 |; 6 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 66 ( 15 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(totality,axiom,
! [X0,X1] :
( 'less$uthan'(X1,X0)
| 'less$uthan'(X0,X1) ) ).
fof(stricly_smaller_definition,axiom,
! [X0,X1] :
( 'strictly$uless$uthan'(X0,X1)
<=> ( ~ 'less$uthan'(X1,X0)
& 'less$uthan'(X0,X1) ) ) ).
fof(ax40,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ) ).
fof(ax41,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> X2 = bad ) ).
fof(ax46,axiom,
! [X0,X1] : 'findmin$ucpq$ueff'(triple(X0,'create$uslb',X1)) = triple(X0,'create$uslb',bad) ).
fof(ax47,axiom,
! [X0,X1,X2,X3] :
( ( ~ 'contains$uslb'(X1,'findmin$upqp$ures'(X0))
& X1 != 'create$uslb' )
=> 'findmin$ucpq$ueff'(triple(X0,X1,X2)) = triple(X0,'update$uslb'(X1,'findmin$upqp$ures'(X0)),bad) ) ).
fof(ax48,axiom,
! [X0,X1,X2,X3] :
( ( 'strictly$uless$uthan'('findmin$upqp$ures'(X0),'lookup$uslb'(X1,'findmin$upqp$ures'(X0)))
& 'contains$uslb'(X1,'findmin$upqp$ures'(X0))
& X1 != 'create$uslb' )
=> 'findmin$ucpq$ueff'(triple(X0,X1,X2)) = triple(X0,'update$uslb'(X1,'findmin$upqp$ures'(X0)),bad) ) ).
fof(ax49,axiom,
! [X0,X1,X2,X3] :
( ( 'less$uthan'('lookup$uslb'(X1,'findmin$upqp$ures'(X0)),'findmin$upqp$ures'(X0))
& 'contains$uslb'(X1,'findmin$upqp$ures'(X0))
& X1 != 'create$uslb' )
=> 'findmin$ucpq$ueff'(triple(X0,X1,X2)) = triple(X0,'update$uslb'(X1,'findmin$upqp$ures'(X0)),X2) ) ).
fof(l15_co,conjecture,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok('findmin$ucpq$ueff'(triple(X0,X1,X2))) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok('findmin$ucpq$ueff'(triple(X0,X1,X2))) ),
inference(negate_conjecture,[status(cth)],[l15_co]) ).
cnf(c1,plain,
( 'less$uthan'(X1,X0)
| 'less$uthan'(X0,X1) ),
inference(clausification,[status(esa)],[totality]) ).
cnf(c5,plain,
( 'less$uthan'(X1,X0)
| ~ 'less$uthan'(X0,X1)
| 'strictly$uless$uthan'(X0,X1) ),
inference(clausification,[status(esa)],[stricly_smaller_definition]) ).
cnf(c36,plain,
~ ok(triple(X0,X1,bad)),
inference(clausification,[status(esa)],[ax40]) ).
cnf(c37,plain,
( X2 = bad
| ok(triple(X0,X1,X2)) ),
inference(clausification,[status(esa)],[ax41]) ).
cnf(c42,plain,
'findmin$ucpq$ueff'(triple(X0,'create$uslb',X1)) = triple(X0,'create$uslb',bad),
inference(clausification,[status(esa)],[ax46]) ).
cnf(c43,plain,
( 'findmin$ucpq$ueff'(triple(X1,X0,X2)) = triple(X1,'update$uslb'(X0,'findmin$upqp$ures'(X1)),bad)
| 'contains$uslb'(X0,'findmin$upqp$ures'(X1))
| X0 = 'create$uslb' ),
inference(clausification,[status(esa)],[ax47]) ).
cnf(c44,plain,
( 'findmin$ucpq$ueff'(triple(X1,X0,X2)) = triple(X1,'update$uslb'(X0,'findmin$upqp$ures'(X1)),bad)
| ~ 'strictly$uless$uthan'('findmin$upqp$ures'(X1),'lookup$uslb'(X0,'findmin$upqp$ures'(X1)))
| ~ 'contains$uslb'(X0,'findmin$upqp$ures'(X1))
| X0 = 'create$uslb' ),
inference(clausification,[status(esa)],[ax48]) ).
cnf(c45,plain,
( 'findmin$ucpq$ueff'(triple(X1,X0,X2)) = triple(X1,'update$uslb'(X0,'findmin$upqp$ures'(X1)),X2)
| ~ 'less$uthan'('lookup$uslb'(X0,'findmin$upqp$ures'(X1)),'findmin$upqp$ures'(X1))
| ~ 'contains$uslb'(X0,'findmin$upqp$ures'(X1))
| X0 = 'create$uslb' ),
inference(clausification,[status(esa)],[ax49]) ).
cnf(c50,plain,
~ ok(triple(sK117,sK118,sK119)),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c51,plain,
ok('findmin$ucpq$ueff'(triple(sK117,sK118,sK119))),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
sK119 = bad,
inference(resolution,[status(thm)],[c37,c50]) ).
cnf(d1,plain,
ok('findmin$ucpq$ueff'(triple(sK117,sK118,bad))),
inference(demodulation,[status(thm)],[c51,d0]) ).
cnf(d2,plain,
( 'contains$uslb'(X1,'findmin$upqp$ures'(X0))
| X1 = 'create$uslb'
| ~ ok('findmin$ucpq$ueff'(triple(X0,X1,X2))) ),
inference(superposition,[status(thm)],[c43,c36]) ).
cnf(d3,plain,
( 'contains$uslb'(sK118,'findmin$upqp$ures'(sK117))
| sK118 = 'create$uslb' ),
inference(resolution,[status(thm)],[d2,d1]) ).
cnf(d4,plain,
( ~ 'contains$uslb'(X1,'findmin$upqp$ures'(X0))
| ~ 'less$uthan'('lookup$uslb'(X1,'findmin$upqp$ures'(X0)),'findmin$upqp$ures'(X0))
| X1 = 'create$uslb'
| ~ ok('findmin$ucpq$ueff'(triple(X0,X1,bad))) ),
inference(superposition,[status(thm)],[c45,c36]) ).
cnf(d5,plain,
( 'less$uthan'(X0,X1)
| 'strictly$uless$uthan'(X1,X0)
| 'less$uthan'(X0,X1) ),
inference(resolution,[status(thm)],[c5,c1]) ).
cnf(d6,plain,
( ~ 'contains$uslb'(X1,'findmin$upqp$ures'(X0))
| ~ 'strictly$uless$uthan'('findmin$upqp$ures'(X0),'lookup$uslb'(X1,'findmin$upqp$ures'(X0)))
| X1 = 'create$uslb'
| ~ ok('findmin$ucpq$ueff'(triple(X0,X1,X2))) ),
inference(superposition,[status(thm)],[c44,c36]) ).
cnf(d7,plain,
( 'less$uthan'('lookup$uslb'(X0,'findmin$upqp$ures'(X1)),'findmin$upqp$ures'(X1))
| ~ ok('findmin$ucpq$ueff'(triple(X1,X0,X2)))
| ~ 'contains$uslb'(X0,'findmin$upqp$ures'(X1))
| X0 = 'create$uslb' ),
inference(resolution,[status(thm)],[d6,d5]) ).
cnf(d8,plain,
( ~ ok('findmin$ucpq$ueff'(triple(X1,X0,bad)))
| ~ 'contains$uslb'(X0,'findmin$upqp$ures'(X1))
| X0 = 'create$uslb'
| ~ ok('findmin$ucpq$ueff'(triple(X1,X0,X2)))
| ~ 'contains$uslb'(X0,'findmin$upqp$ures'(X1))
| X0 = 'create$uslb' ),
inference(resolution,[status(thm)],[d7,d4]) ).
cnf(d9,plain,
( ~ ok('findmin$ucpq$ueff'(triple(sK117,sK118,X0)))
| ~ 'contains$uslb'(sK118,'findmin$upqp$ures'(sK117))
| sK118 = 'create$uslb' ),
inference(resolution,[status(thm)],[d8,d1]) ).
cnf(d10,plain,
( ~ 'contains$uslb'(sK118,'findmin$upqp$ures'(sK117))
| sK118 = 'create$uslb' ),
inference(resolution,[status(thm)],[d9,d1]) ).
cnf(d11,plain,
( sK118 = 'create$uslb'
| sK118 = 'create$uslb' ),
inference(resolution,[status(thm)],[d10,d3]) ).
cnf(d12,plain,
ok('findmin$ucpq$ueff'(triple(sK117,'create$uslb',bad))),
inference(demodulation,[status(thm)],[d1,d11]) ).
cnf(d13,plain,
ok(triple(sK117,'create$uslb',bad)),
inference(demodulation,[status(thm)],[d12,c42]) ).
cnf(d14,plain,
$false,
inference(resolution,[status(thm)],[c36,d13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV379+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.45 % Computer : n005.cluster.edu
% 0.17/0.45 % Model : x86_64 x86_64
% 0.17/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.45 % Memory : 8046.5625MB
% 0.17/0.45 % OS : Linux 6.8.0-71-generic
% 0.17/0.45 % CPULimit : 300
% 0.17/0.45 % WCLimit : 300
% 0.17/0.45 % DateTime : Sat Sep 26 13:39:47 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 39.80/5.72 % SZS status Theorem for theBenchmark.p
% 39.80/5.72 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------