%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SWV385+1 : TPTP v9.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Apr 9 09:30:23 PM UTC 2025
% Result : Theorem 4.71s 2.10s
% Output : CNFRefutation 4.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 35 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 35 ( 21 ~; 9 |; 0 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 22 ( 22 usr; 6 con; 0-3 aty)
% Number of variables : 27 ( 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pair_in_list > succ_cpq > strictly_less_than > less_than > contains_slb > contains_cpq > ok > isnonempty_slb > check_cpq > triple > update_slb > remove_slb > remove_pqp > remove_cpq > pair > lookup_slb > insert_slb > insert_pqp > insert_cpq > #nlpp > removemin_cpq_res > removemin_cpq_eff > im_succ_cpq > findmin_pqp_res > findmin_cpq_res > findmin_cpq_eff > create_slb > bottom > bad > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(bad,type,
bad: $i ).
tff(insert_cpq,type,
insert_cpq: ( $i * $i ) > $i ).
tff(succ_cpq,type,
succ_cpq: ( $i * $i ) > $o ).
tff(remove_cpq,type,
remove_cpq: ( $i * $i ) > $i ).
tff(contains_slb,type,
contains_slb: ( $i * $i ) > $o ).
tff(lookup_slb,type,
lookup_slb: ( $i * $i ) > $i ).
tff(pair_in_list,type,
pair_in_list: ( $i * $i * $i ) > $o ).
tff(less_than,type,
less_than: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(contains_cpq,type,
contains_cpq: ( $i * $i ) > $o ).
tff(strictly_less_than,type,
strictly_less_than: ( $i * $i ) > $o ).
tff(pair,type,
pair: ( $i * $i ) > $i ).
tff(ok,type,
ok: $i > $o ).
tff(insert_pqp,type,
insert_pqp: ( $i * $i ) > $i ).
tff(findmin_pqp_res,type,
findmin_pqp_res: $i > $i ).
tff(remove_pqp,type,
remove_pqp: ( $i * $i ) > $i ).
tff(im_succ_cpq,type,
im_succ_cpq: $i > $i ).
tff(bottom,type,
bottom: $i ).
tff(triple,type,
triple: ( $i * $i * $i ) > $i ).
tff(removemin_cpq_res,type,
removemin_cpq_res: $i > $i ).
tff(isnonempty_slb,type,
isnonempty_slb: $i > $o ).
tff(check_cpq,type,
check_cpq: $i > $o ).
tff(remove_slb,type,
remove_slb: ( $i * $i ) > $i ).
tff(findmin_cpq_eff,type,
findmin_cpq_eff: $i > $i ).
tff(removemin_cpq_eff,type,
removemin_cpq_eff: $i > $i ).
tff(create_slb,type,
create_slb: $i ).
tff(findmin_cpq_res,type,
findmin_cpq_res: $i > $i ).
tff(insert_slb,type,
insert_slb: ( $i * $i ) > $i ).
tff(update_slb,type,
update_slb: ( $i * $i ) > $i ).
tff(f_222,axiom,
! [U,V,W] :
( ~ ok(triple(U,V,W))
=> ( W = bad ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax41) ).
tff(f_313,negated_conjecture,
~ ! [U,V,W] :
( ( ~ check_cpq(triple(U,V,W))
| ~ ok(triple(U,V,W)) )
=> ( ~ check_cpq(im_succ_cpq(triple(U,V,W)))
| ~ ok(im_succ_cpq(triple(U,V,W))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l21_co) ).
tff(f_299,lemma,
! [U,V,W] :
( ~ check_cpq(triple(U,V,W))
=> ( ~ check_cpq(im_succ_cpq(triple(U,V,W)))
| ~ ok(im_succ_cpq(triple(U,V,W))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l21_li2225) ).
tff(f_217,axiom,
! [U,V] :
( ok(triple(U,V,bad))
<=> $false ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax40) ).
tff(f_289,lemma,
! [U,V,W] :
( ~ ok(triple(U,V,W))
=> ~ ok(im_succ_cpq(triple(U,V,W))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l21_li1316) ).
tff(c_869,plain,
! [W_282,U_283,V_284] :
( ( bad = W_282 )
| ok(triple(U_283,V_284,W_282)) ),
inference(cnfTransformation,[status(thm)],[f_222]) ).
tff(c_110,plain,
( ~ ok(triple('#skF_1','#skF_2','#skF_3'))
| ~ check_cpq(triple('#skF_1','#skF_2','#skF_3')) ),
inference(cnfTransformation,[status(thm)],[f_313]) ).
tff(c_174,plain,
~ check_cpq(triple('#skF_1','#skF_2','#skF_3')),
inference(splitLeft,[status(thm)],[c_110]) ).
tff(c_108,plain,
check_cpq(im_succ_cpq(triple('#skF_1','#skF_2','#skF_3'))),
inference(cnfTransformation,[status(thm)],[f_313]) ).
tff(c_106,plain,
ok(im_succ_cpq(triple('#skF_1','#skF_2','#skF_3'))),
inference(cnfTransformation,[status(thm)],[f_313]) ).
tff(c_854,plain,
! [U_279,V_280,W_281] :
( ~ ok(im_succ_cpq(triple(U_279,V_280,W_281)))
| ~ check_cpq(im_succ_cpq(triple(U_279,V_280,W_281)))
| check_cpq(triple(U_279,V_280,W_281)) ),
inference(cnfTransformation,[status(thm)],[f_299]) ).
tff(c_860,plain,
( ~ check_cpq(im_succ_cpq(triple('#skF_1','#skF_2','#skF_3')))
| check_cpq(triple('#skF_1','#skF_2','#skF_3')) ),
inference(resolution,[status(thm)],[c_106,c_854]) ).
tff(c_864,plain,
check_cpq(triple('#skF_1','#skF_2','#skF_3')),
inference(demodulation,[status(thm),theory(equality)],[c_108,c_860]) ).
tff(c_866,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_174,c_864]) ).
tff(c_867,plain,
~ ok(triple('#skF_1','#skF_2','#skF_3')),
inference(splitRight,[status(thm)],[c_110]) ).
tff(c_877,plain,
bad = '#skF_3',
inference(resolution,[status(thm)],[c_869,c_867]) ).
tff(c_74,plain,
! [U_75,V_76] : ~ ok(triple(U_75,V_76,bad)),
inference(cnfTransformation,[status(thm)],[f_217]) ).
tff(c_881,plain,
! [U_75,V_76] : ~ ok(triple(U_75,V_76,'#skF_3')),
inference(demodulation,[status(thm),theory(equality)],[c_877,c_74]) ).
tff(c_1106,plain,
! [U_342,V_343,W_344] :
( ~ ok(im_succ_cpq(triple(U_342,V_343,W_344)))
| ok(triple(U_342,V_343,W_344)) ),
inference(cnfTransformation,[status(thm)],[f_289]) ).
tff(c_1109,plain,
ok(triple('#skF_1','#skF_2','#skF_3')),
inference(resolution,[status(thm)],[c_106,c_1106]) ).
tff(c_1113,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_881,c_1109]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWV385+1 : TPTP v9.0.0. Released v3.3.0.
% 0.11/0.12 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.11/0.32 % Computer : n017.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Wed Apr 9 03:10:10 EDT 2025
% 0.11/0.32 % CPUTime :
% 4.71/2.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.71/2.10
% 4.71/2.10 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------