%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWV374+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n017.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:12 AM UTC 2026
% Result : Theorem 13.31s 3.86s
% Output : CNFRefutation 13.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 8 unt; 0 def)
% Number of atoms : 74 ( 31 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 67 ( 21 ~; 32 |; 8 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 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 : 44 ( 15 sgn 22 !; 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(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(l10_co,conjecture,
! [X0,X1,X2] :
( ok('findmin$ucpq$ueff'(triple(X0,X1,X2)))
=> ( 'less$uthan'('lookup$uslb'(X1,'findmin$upqp$ures'(X0)),'findmin$upqp$ures'(X0))
& 'contains$uslb'(X1,'findmin$upqp$ures'(X0))
& X1 != 'create$uslb' ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0,X1,X2] :
( ok('findmin$ucpq$ueff'(triple(X0,X1,X2)))
=> ( 'less$uthan'('lookup$uslb'(X1,'findmin$upqp$ures'(X0)),'findmin$upqp$ures'(X0))
& 'contains$uslb'(X1,'findmin$upqp$ures'(X0))
& X1 != 'create$uslb' ) ),
inference(negate_conjecture,[status(cth)],[l10_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(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(c50,plain,
ok('findmin$ucpq$ueff'(triple(sK117,sK118,sK119))),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c51,plain,
( ~ 'less$uthan'('lookup$uslb'(sK118,'findmin$upqp$ures'(sK117)),'findmin$upqp$ures'(sK117))
| ~ 'contains$uslb'(sK118,'findmin$upqp$ures'(sK117))
| sK118 = 'create$uslb' ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ~ 'contains$uslb'(sK118,'findmin$upqp$ures'(sK117))
| sK118 = 'create$uslb'
| 'less$uthan'('findmin$upqp$ures'(sK117),'lookup$uslb'(sK118,'findmin$upqp$ures'(sK117))) ),
inference(resolution,[status(thm)],[c1,c51]) ).
cnf(d1,plain,
( ~ 'contains$uslb'(sK118,'findmin$upqp$ures'(sK117))
| sK118 = 'create$uslb'
| 'strictly$uless$uthan'('findmin$upqp$ures'(sK117),'lookup$uslb'(sK118,'findmin$upqp$ures'(sK117)))
| 'less$uthan'('lookup$uslb'(sK118,'findmin$upqp$ures'(sK117)),'findmin$upqp$ures'(sK117)) ),
inference(resolution,[status(thm)],[c5,d0]) ).
cnf(d2,plain,
( ~ 'contains$uslb'(sK118,'findmin$upqp$ures'(sK117))
| 'less$uthan'('lookup$uslb'(sK118,'findmin$upqp$ures'(sK117)),'findmin$upqp$ures'(sK117))
| sK118 = 'create$uslb'
| ~ 'contains$uslb'(sK118,'findmin$upqp$ures'(sK117))
| 'findmin$ucpq$ueff'(triple(sK117,sK118,X0)) = triple(sK117,'update$uslb'(sK118,'findmin$upqp$ures'(sK117)),bad)
| sK118 = 'create$uslb' ),
inference(resolution,[status(thm)],[c44,d1]) ).
cnf(d3,plain,
( ~ 'contains$uslb'(sK118,'findmin$upqp$ures'(sK117))
| sK118 = 'create$uslb'
| ~ 'contains$uslb'(sK118,'findmin$upqp$ures'(sK117))
| sK118 = 'create$uslb'
| 'findmin$ucpq$ueff'(triple(sK117,sK118,X0)) = triple(sK117,'update$uslb'(sK118,'findmin$upqp$ures'(sK117)),bad) ),
inference(resolution,[status(thm)],[d2,c51]) ).
cnf(d4,plain,
( 'findmin$ucpq$ueff'(triple(sK117,sK118,X1)) = triple(sK117,'update$uslb'(sK118,'findmin$upqp$ures'(sK117)),bad)
| sK118 = 'create$uslb'
| sK118 = 'create$uslb'
| 'findmin$ucpq$ueff'(triple(sK117,sK118,X0)) = triple(sK117,'update$uslb'(sK118,'findmin$upqp$ures'(sK117)),bad) ),
inference(resolution,[status(thm)],[d3,c43]) ).
cnf(d5,plain,
( sK118 = 'create$uslb'
| 'findmin$ucpq$ueff'(triple(sK117,sK118,X1)) = triple(sK117,'update$uslb'(sK118,'findmin$upqp$ures'(sK117)),bad)
| ~ ok('findmin$ucpq$ueff'(triple(sK117,sK118,X0))) ),
inference(superposition,[status(thm)],[d4,c36]) ).
cnf(d6,plain,
( sK118 = 'create$uslb'
| 'findmin$ucpq$ueff'(triple(sK117,sK118,X0)) = triple(sK117,'update$uslb'(sK118,'findmin$upqp$ures'(sK117)),bad) ),
inference(resolution,[status(thm)],[d5,c50]) ).
cnf(d7,plain,
( sK118 = 'create$uslb'
| ~ ok('findmin$ucpq$ueff'(triple(sK117,sK118,X0))) ),
inference(superposition,[status(thm)],[d6,c36]) ).
cnf(d8,plain,
sK118 = 'create$uslb',
inference(resolution,[status(thm)],[d7,c50]) ).
cnf(d9,plain,
ok('findmin$ucpq$ueff'(triple(sK117,'create$uslb',sK119))),
inference(demodulation,[status(thm)],[c50,d8]) ).
cnf(d10,plain,
ok(triple(sK117,'create$uslb',bad)),
inference(demodulation,[status(thm)],[d9,c42]) ).
cnf(d11,plain,
$false,
inference(resolution,[status(thm)],[c36,d10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWV374+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.43 % Computer : n017.cluster.edu
% 0.15/0.43 % Model : x86_64 x86_64
% 0.15/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.43 % Memory : 8046.5625MB
% 0.15/0.43 % OS : Linux 6.8.0-71-generic
% 0.15/0.43 % CPULimit : 300
% 0.15/0.43 % WCLimit : 300
% 0.15/0.43 % DateTime : Sat Sep 26 13:35:03 UTC 2026
% 0.15/0.43 % CPUTime :
% 0.15/0.43 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.31/3.86 % SZS status Theorem for theBenchmark.p
% 13.31/3.86 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------