TSTP Solution File: SWV371+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV371+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n022.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 : Tue Aug 22 11:03:56 EDT 2023
% Result : Theorem 8.22s 2.86s
% Output : CNFRefutation 8.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 56
% Syntax : Number of formulae : 68 ( 8 unt; 52 typ; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 5 |; 1 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 76 ( 45 >; 31 *; 0 +; 0 <<)
% Number of predicates : 20 ( 19 usr; 1 prp; 0-3 aty)
% Number of functors : 33 ( 33 usr; 7 con; 0-3 aty)
% Number of variables : 19 (; 19 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pair_in_list > succ_cpq > strictly_less_than > pi_sharp_removemin > pi_sharp_remove > pi_sharp_find_min > pi_remove > less_than > issmallestelement_pq > contains_slb > contains_pq > contains_cpq > pi_removemin > pi_find_min > phi > ok > isnonempty_slb > isnonempty_pq > check_cpq > triple > update_slb > removemin_pq_res > removemin_pq_eff > remove_slb > remove_pqp > remove_pq > remove_cpq > pair > lookup_slb > insert_slb > insert_pqp > insert_pq > insert_cpq > findmin_pq_res > findmin_pq_eff > #nlpp > removemin_cpq_res > removemin_cpq_eff > i > findmin_pqp_res > findmin_cpq_res > findmin_cpq_eff > create_slb > create_pq > bottom > bad > #skF_2 > #skF_4 > #skF_7 > #skF_5 > #skF_6 > #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(pi_sharp_find_min,type,
pi_sharp_find_min: ( $i * $i ) > $o ).
tff(pi_remove,type,
pi_remove: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(succ_cpq,type,
succ_cpq: ( $i * $i ) > $o ).
tff(insert_pq,type,
insert_pq: ( $i * $i ) > $i ).
tff(pi_find_min,type,
pi_find_min: $i > $o ).
tff(i,type,
i: $i > $i ).
tff(remove_cpq,type,
remove_cpq: ( $i * $i ) > $i ).
tff(pi_sharp_removemin,type,
pi_sharp_removemin: ( $i * $i ) > $o ).
tff(pi_sharp_remove,type,
pi_sharp_remove: ( $i * $i ) > $o ).
tff(contains_slb,type,
contains_slb: ( $i * $i ) > $o ).
tff(contains_pq,type,
contains_pq: ( $i * $i ) > $o ).
tff(findmin_pq_eff,type,
findmin_pq_eff: ( $i * $i ) > $i ).
tff(lookup_slb,type,
lookup_slb: ( $i * $i ) > $i ).
tff(pi_removemin,type,
pi_removemin: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(phi,type,
phi: $i > $o ).
tff(pair_in_list,type,
pair_in_list: ( $i * $i * $i ) > $o ).
tff(isnonempty_pq,type,
isnonempty_pq: $i > $o ).
tff(findmin_pq_res,type,
findmin_pq_res: ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(less_than,type,
less_than: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(issmallestelement_pq,type,
issmallestelement_pq: ( $i * $i ) > $o ).
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(remove_pq,type,
remove_pq: ( $i * $i ) > $i ).
tff(findmin_pqp_res,type,
findmin_pqp_res: $i > $i ).
tff(remove_pqp,type,
remove_pqp: ( $i * $i ) > $i ).
tff(bottom,type,
bottom: $i ).
tff(removemin_pq_res,type,
removemin_pq_res: ( $i * $i ) > $i ).
tff(triple,type,
triple: ( $i * $i * $i ) > $i ).
tff(create_pq,type,
create_pq: $i ).
tff(removemin_cpq_res,type,
removemin_cpq_res: $i > $i ).
tff('#skF_3',type,
'#skF_3': $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(removemin_pq_eff,type,
removemin_pq_eff: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $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_449,negated_conjecture,
~ ! [U,V,W] :
( phi(findmin_cpq_eff(triple(U,V,W)))
=> pi_sharp_find_min(i(triple(U,V,W)),findmin_cpq_res(triple(U,V,W))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_co) ).
tff(f_443,lemma,
! [U,V,W] :
( phi(findmin_cpq_eff(triple(U,V,W)))
=> issmallestelement_pq(i(triple(U,V,W)),findmin_cpq_res(triple(U,V,W))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_lX) ).
tff(f_438,lemma,
! [U,V,W] :
( phi(findmin_cpq_eff(triple(U,V,W)))
=> contains_pq(i(triple(U,V,W)),findmin_cpq_res(triple(U,V,W))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l7_l8) ).
tff(f_406,axiom,
! [U,V] :
( pi_sharp_find_min(U,V)
<=> ( contains_pq(U,V)
& issmallestelement_pq(U,V) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax58) ).
tff(c_180,plain,
phi(findmin_cpq_eff(triple('#skF_5','#skF_6','#skF_7'))),
inference(cnfTransformation,[status(thm)],[f_449]) ).
tff(c_5197,plain,
! [U_796,V_797,W_798] :
( issmallestelement_pq(i(triple(U_796,V_797,W_798)),findmin_cpq_res(triple(U_796,V_797,W_798)))
| ~ phi(findmin_cpq_eff(triple(U_796,V_797,W_798))) ),
inference(cnfTransformation,[status(thm)],[f_443]) ).
tff(c_2442,plain,
! [U_519,V_520,W_521] :
( contains_pq(i(triple(U_519,V_520,W_521)),findmin_cpq_res(triple(U_519,V_520,W_521)))
| ~ phi(findmin_cpq_eff(triple(U_519,V_520,W_521))) ),
inference(cnfTransformation,[status(thm)],[f_438]) ).
tff(c_472,plain,
! [U_292,V_293] :
( pi_sharp_find_min(U_292,V_293)
| ~ issmallestelement_pq(U_292,V_293)
| ~ contains_pq(U_292,V_293) ),
inference(cnfTransformation,[status(thm)],[f_406]) ).
tff(c_178,plain,
~ pi_sharp_find_min(i(triple('#skF_5','#skF_6','#skF_7')),findmin_cpq_res(triple('#skF_5','#skF_6','#skF_7'))),
inference(cnfTransformation,[status(thm)],[f_449]) ).
tff(c_501,plain,
( ~ issmallestelement_pq(i(triple('#skF_5','#skF_6','#skF_7')),findmin_cpq_res(triple('#skF_5','#skF_6','#skF_7')))
| ~ contains_pq(i(triple('#skF_5','#skF_6','#skF_7')),findmin_cpq_res(triple('#skF_5','#skF_6','#skF_7'))) ),
inference(resolution,[status(thm)],[c_472,c_178]) ).
tff(c_698,plain,
~ contains_pq(i(triple('#skF_5','#skF_6','#skF_7')),findmin_cpq_res(triple('#skF_5','#skF_6','#skF_7'))),
inference(splitLeft,[status(thm)],[c_501]) ).
tff(c_2445,plain,
~ phi(findmin_cpq_eff(triple('#skF_5','#skF_6','#skF_7'))),
inference(resolution,[status(thm)],[c_2442,c_698]) ).
tff(c_2472,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_180,c_2445]) ).
tff(c_2473,plain,
~ issmallestelement_pq(i(triple('#skF_5','#skF_6','#skF_7')),findmin_cpq_res(triple('#skF_5','#skF_6','#skF_7'))),
inference(splitRight,[status(thm)],[c_501]) ).
tff(c_5221,plain,
~ phi(findmin_cpq_eff(triple('#skF_5','#skF_6','#skF_7'))),
inference(resolution,[status(thm)],[c_5197,c_2473]) ).
tff(c_5265,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_180,c_5221]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV371+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 22:26:18 EDT 2023
% 0.13/0.35 % CPUTime :
% 8.22/2.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.22/2.86
% 8.22/2.86 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.22/2.89
% 8.22/2.89 Inference rules
% 8.22/2.89 ----------------------
% 8.22/2.89 #Ref : 0
% 8.22/2.89 #Sup : 1149
% 8.22/2.89 #Fact : 26
% 8.22/2.89 #Define : 0
% 8.22/2.89 #Split : 7
% 8.22/2.89 #Chain : 0
% 8.22/2.89 #Close : 0
% 8.22/2.89
% 8.22/2.89 Ordering : KBO
% 8.22/2.89
% 8.22/2.89 Simplification rules
% 8.22/2.89 ----------------------
% 8.22/2.89 #Subsume : 175
% 8.22/2.89 #Demod : 313
% 8.22/2.89 #Tautology : 472
% 8.22/2.89 #SimpNegUnit : 30
% 8.22/2.89 #BackRed : 15
% 8.22/2.89
% 8.22/2.89 #Partial instantiations: 0
% 8.22/2.89 #Strategies tried : 1
% 8.22/2.89
% 8.22/2.89 Timing (in seconds)
% 8.22/2.89 ----------------------
% 8.40/2.89 Preprocessing : 0.65
% 8.40/2.89 Parsing : 0.33
% 8.40/2.89 CNF conversion : 0.05
% 8.40/2.89 Main loop : 1.20
% 8.40/2.89 Inferencing : 0.45
% 8.40/2.89 Reduction : 0.39
% 8.40/2.89 Demodulation : 0.28
% 8.40/2.89 BG Simplification : 0.05
% 8.40/2.89 Subsumption : 0.22
% 8.40/2.89 Abstraction : 0.04
% 8.40/2.89 MUC search : 0.00
% 8.40/2.89 Cooper : 0.00
% 8.40/2.89 Total : 1.89
% 8.40/2.89 Index Insertion : 0.00
% 8.40/2.89 Index Deletion : 0.00
% 8.40/2.89 Index Matching : 0.00
% 8.40/2.89 BG Taut test : 0.00
%------------------------------------------------------------------------------